Bounds for naive multiple machine scheduling with release times and deadlines
- 31 March 1984
- journal article
- Published by Elsevier BV in Journal of Algorithms
- Vol. 5 (1), 1-6
- https://doi.org/10.1016/0196-6774(84)90035-x
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Parametric Combinatorial Computing and a Problem of Program Module DistributionJournal of the ACM, 1983
- Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and DeadlinesSIAM Journal on Computing, 1983
- Scheduling Unit–Time Tasks with Arbitrary Release Times and DeadlinesSIAM Journal on Computing, 1981
- Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery TimesOperations Research, 1980
- Some simple scheduling algorithmsNaval Research Logistics Quarterly, 1974
- Bounds on Multiprocessing Timing AnomaliesSIAM Journal on Applied Mathematics, 1969