Preemptive Online Scheduling: Optimal Algorithms for All Speeds
Authors:
- 1 January 2006
- book chapter
- Published by Springer Nature
- p. 327-339
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Optimal and Online Preemptive Scheduling on Uniformly Related Machines2004
- Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratiosOperations Research Letters, 2001
- Randomized on-line scheduling on two uniform machinesJournal of Scheduling, 2001
- On-line scheduling revisitedJournal of Scheduling, 2000
- On-Line Load Balancing for Related MachinesJournal of Algorithms, 2000
- A lower bound for on-line scheduling on uniformly related machinesOperations Research Letters, 2000
- An optimal algorithm for preemptive on-line schedulingOperations Research Letters, 1995
- A lower bound for randomized on-line scheduling algorithmsInformation Processing Letters, 1994
- Preemptive Scheduling of Uniform Processor SystemsJournal of the ACM, 1978
- Bounds for Certain Multiprocessing AnomaliesBell System Technical Journal, 1966