A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
- 1 June 1988
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 17 (3) , 539-551
- https://doi.org/10.1137/0217033
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Using dual approximation algorithms for scheduling problems theoretical and practical resultsJournal of the ACM, 1987
- Bounds for Multifit Scheduling on Uniform ProcessorsSIAM Journal on Computing, 1983
- 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 LPT Schedules on Uniform ProcessorsSIAM Journal on Computing, 1977
- Exact and Approximate Algorithms for Scheduling Nonidentical ProcessorsJournal of the ACM, 1976
- Bounds for Certain Multiprocessing AnomaliesBell System Technical Journal, 1966