Preemptive Scheduling of Uniform Machines Subject to Release Dates
- 1 January 1984
- book chapter
- Published by Elsevier
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Computing Maximal “Polymatroidal” Network FlowsMathematics of Operations Research, 1982
- Preemptive Scheduling with Release Times, Deadlines, and Due TimesJournal of the ACM, 1982
- Scheduling Independent Tasks with Due Times on a Uniform Processor SystemJournal of the ACM, 1980
- 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
- Complexity of Machine Scheduling ProblemsPublished by Elsevier ,1977
- A Level Algorithm for Preemptive SchedulingJournal of the ACM, 1977
- Scheduling independent tasks to reduce mean finishing timeCommunications of the ACM, 1974
- Some simple scheduling algorithmsNaval Research Logistics Quarterly, 1974
- Various optimizers for single‐stage productionNaval Research Logistics Quarterly, 1956