An algorithm for flow time minimization and its asymptotic makespan properties
References (18)
Distribution-free bounds on the expectation of the maximum with scheduling applications
Oper. Res. Lett.
(1990)A strong limit theorem for the oscillation modulus of the uniform empirical quantile process
Stochastic Process. Appl.
(1984)- et al.
Scheduling independent tasks to reduce mean finishing time
Comm. ACM
(1974) - et al.
Algorithms for minimizing mean flow time
- (1976)
- et al.
Expected makespan for largest-first multiprocessor scheduling
- et al.
A note on expected makespans for largest-first sequences of independent tasks on two processors
Math. Oper. Res.
(1984) - et al.
Algorithms minimizing mean flow time: Schedule-length properties
Acta Inform.
(1976) The largest exponential spacing
Utilitas Math.
(1984)
There are more references available in the full text version of this article.
Cited by (0)
Copyright © 1992 Published by Elsevier B.V.