Optimal non-preemptive semi-online scheduling on two related machines
Authors:
- Leah EpsteinLELeah Epstein
- Lene M. FavrholdtLFLene M. Favrholdt
- 1 September 2005
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 57 (1) , 49-73
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Randomized on-line scheduling on two uniform machinesJournal of Scheduling, 2001
- Semi-online scheduling with decreasing job sizesOperations Research Letters, 2000
- A Parametric Worst Case Analysis of the LPT Heuristic for Two Uniform MachinesOperations Research, 1997
- Tighter Bounds for LPT Scheduling on Uniform ProcessorsSIAM Journal on Computing, 1987
- Scheduling Independent Tasks on Uniform ProcessorsSIAM Journal on Computing, 1984
- Bounds for List Schedules on Uniform ProcessorsSIAM Journal on Computing, 1980
- Bounds for LPT Schedules on Uniform ProcessorsSIAM Journal on Computing, 1977
- Bounds on Multiprocessing Timing AnomaliesSIAM Journal on Applied Mathematics, 1969