Optimal preemptive semi-online scheduling to minimize makespan on two related machines
- 31 August 2002
- journal article
- research article
- Published by Elsevier in Operations Research Letters
- Vol. 30 (4) , 269-275
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Optimal Non-preemptive Semi-online Scheduling on Two Related Machines2002
- 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
- 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
- An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List SchedulingSIAM Journal on Computing, 1993
- Tighter Bounds for LPT Scheduling on Uniform ProcessorsSIAM Journal on Computing, 1987
- Scheduling Independent Tasks on Uniform ProcessorsSIAM Journal on Computing, 1984
- Bounds on Multiprocessing Timing AnomaliesSIAM Journal on Applied Mathematics, 1969
- Bounds for Certain Multiprocessing AnomaliesBell System Technical Journal, 1966