A lower bound for randomized on-line multiprocessor scheduling
- 14 July 1997
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 63 (1) , 51-55
- https://doi.org/10.1016/s0020-0190(97)00093-8
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- New Algorithms for an Ancient Scheduling ProblemJournal of Computer and System Sciences, 1995
- An optimal algorithm for preemptive on-line schedulingOperations Research Letters, 1995
- A lower bound for randomized on-line scheduling algorithmsInformation Processing Letters, 1994
- A better lower bound for on-line schedulingInformation Processing Letters, 1994
- An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List SchedulingSIAM Journal on Computing, 1993
- Bounds for Certain Multiprocessing AnomaliesBell System Technical Journal, 1966