A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines
Authors:
- 4 July 2001
- book chapter
- Published by Springer Nature
- p. 848-861
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Approximation schemes for scheduling on parallel machinesJournal of Scheduling, 1998
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation AlgorithmsMathematics of Operations Research, 1997
- 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
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey1979
- Complexity of Machine Scheduling Problems1977
- Various optimizers for single‐stage productionNaval Research Logistics Quarterly, 1956