On-line scheduling
- 1 January 1998
- book chapter
- Published by Springer Nature
- p. 196-231
- https://doi.org/10.1007/bfb0029570
Abstract
No abstract availableKeywords
This publication has 57 references indexed in Scilit:
- Scheduling on identical machines: How good is LPT in an on-line setting?Operations Research Letters, 1997
- A lower bound for randomized on-line multiprocessor schedulingInformation Processing Letters, 1997
- Semi on-line algorithms for the partition problemOperations Research Letters, 1997
- 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
- Nonclairvoyant schedulingTheoretical Computer Science, 1994
- On-line scheduling of jobs with fixed start and end timesTheoretical Computer Science, 1994
- A better lower bound for on-line schedulingInformation Processing Letters, 1994
- On the power of randomization in on-line algorithmsAlgorithmica, 1994