Scheduling uniform machines on-line requires nondecreasing speed ratios
- 1 June 1998
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 82 (1-2) , 225-234
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- New Algorithms for an Ancient Scheduling ProblemJournal of Computer and System Sciences, 1995
- An optimal algorithm for preemptive on-line schedulingOperations Research Letters, 1995
- Chapter 9 Sequencing and scheduling: Algorithms and complexity1993
- On-line scheduling of real-time tasksIEEE Transactions on Computers, 1992
- Preemptive Scheduling of Uniform Machines Subject to Release Dates1984
- Nearly on Line Scheduling of a Uniform Processor System with Release TimesSIAM Journal on Computing, 1979
- Preemptive Scheduling of Uniform Processor SystemsJournal of the ACM, 1978
- A Level Algorithm for Preemptive SchedulingJournal of the ACM, 1977