Scheduling Parallel Machines On-Line
- 1 December 1995
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 24 (6) , 1313-1331
- https://doi.org/10.1137/s0097539793248317
Abstract
No abstract availableThis publication has 23 references indexed in Scilit:
- An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List SchedulingSIAM Journal on Computing, 1993
- Dynamic scheduling on parallel machinesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1991
- A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation ApproachSIAM Journal on Computing, 1988
- Using dual approximation algorithms for scheduling problems theoretical and practical resultsJournal of the ACM, 1987
- Bounds for naive multiple machine scheduling with release times and deadlinesJournal of Algorithms, 1984
- Algorithms for Scheduling Tasks on Unrelated ProcessorsJournal of the ACM, 1981
- A New Algorithm for Preemptive Scheduling of TreesJournal of the ACM, 1980
- Bounds for List Schedules on Uniform ProcessorsSIAM Journal on Computing, 1980
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a SurveyPublished by Elsevier ,1979
- Bounds for Certain Multiprocessing AnomaliesBell System Technical Journal, 1966