Optimal and Online Preemptive Scheduling on Uniformly Related Machines
Authors:
- 1 January 2004
- book chapter
- Published by Springer Nature
- p. 199-210
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Bin stretching revisitedActa Informatica, 2003
- Optimal preemptive semi-online scheduling to minimize makespan on two related machinesOperations Research Letters, 2002
- 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
- New algorithms for related machines with temporary jobsJournal of Scheduling, 2000
- On-Line Load Balancing for Related MachinesJournal of Algorithms, 2000
- On-line routing of virtual circuits with applications to load balancing and machine schedulingJournal of the ACM, 1997
- An optimal algorithm for preemptive on-line schedulingOperations Research Letters, 1995
- Scheduling Independent Tasks on Uniform ProcessorsSIAM Journal on Computing, 1984
- Bounds for List Schedules on Uniform ProcessorsSIAM Journal on Computing, 1980