Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios
Author:
- 1 September 2001
- journal article
- research article
- Published by Elsevier in Operations Research Letters
- Vol. 29 (2) , 93-98
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- 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
- Scheduling uniform machines on-line requires nondecreasing speed ratiosMathematical Programming, 1998
- A lower bound for randomized on-line multiprocessor schedulingInformation Processing Letters, 1997
- On-line load balancing for related machinesLecture Notes in Computer Science, 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
- Preemptive Scheduling of Uniform Processor SystemsJournal of the ACM, 1978
- A Level Algorithm for Preemptive SchedulingJournal of the ACM, 1977