Using dual approximation algorithms for scheduling problems theoretical and practical results
- 1 January 1987
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 34 (1) , 144-162
- https://doi.org/10.1145/7531.7535
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A Packing Problem You Can Almost Solve by Sitting on Your SuitcaseSIAM Journal on Algebraic Discrete Methods, 1986
- Tighter Bounds for the Multifit Processor Scheduling AlgorithmSIAM Journal on Computing, 1984
- Bin packing can be solved within 1 + ε in linear timeCombinatorica, 1981
- An Application of Bin-Packing to Multiprocessor SchedulingSIAM Journal on Computing, 1978
- Algorithms for Scheduling Independent TasksJournal of the ACM, 1976
- Fast Approximation Algorithms for the Knapsack and Sum of Subset ProblemsJournal of the ACM, 1975
- Bounds for Certain Multiprocessing AnomaliesBell System Technical Journal, 1966