A lower bound for randomized on-line multiprocessor scheduling
References (10)
- et al.
New algorithms for an ancient scheduling problem
J. Comput. System Sci.
(1995) - et al.
A new lower bound for m-machine scheduling
Inform. Process. Lett.
(1994) - et al.
A lower bound for randomized on-line scheduling algorithms
Inform. Process. Lett.
(1994) - et al.
An optimal algorithm for preemptive on-line scheduling
Oper. Res. Lett.
(1995) - et al.
On the performance of on-line algorithms for partition problems
Acta Cybernet.
(1989)
There are more references available in the full text version of this article.
Cited by (64)
Online algorithms with advice for bin packing and scheduling problems
2015, Theoretical Computer ScienceSemi-online scheduling revisited
2012, Theoretical Computer ScienceRandomized priority algorithms
2010, Theoretical Computer SciencePreemptive scheduling on a small number of hierarchical machines
2008, Information and ComputationParallel solutions for preemptive makespan scheduling on two identical machines
2023, Journal of Scheduling
- 1
Partially supported by grants A119107 and A1019602 of AVČR; part of this work was done at Carnegie-Mellon University, Pittsburgh, PA, USA.
Copyright © 1997 Published by Elsevier B.V.