Non-approximability Results for Scheduling Problems with Minsum Criteria
- 18 June 1998
- book chapter
- Published by Springer Nature
- p. 353-366
- https://doi.org/10.1007/3-540-69346-7_27
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Approximating total flow time on parallel machinesPublished by Association for Computing Machinery (ACM) ,1997
- Approximability and nonapproximability results for minimizing total flow time on a single machinePublished by Association for Computing Machinery (ACM) ,1996
- Three, four, five, six, or the complexity of scheduling with communication delaysOperations Research Letters, 1994
- Chapter 9 Sequencing and scheduling: Algorithms and complexityPublished by Elsevier ,1993
- Proof verification and hardness of approximation problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Optimization, approximation, and complexity classesJournal of Computer and System Sciences, 1991
- Maximum bounded 3-dimensional matching is MAX SNP-completeInformation Processing Letters, 1991
- Approximation algorithms for scheduling unrelated parallel machinesMathematical Programming, 1990
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a SurveyPublished by Elsevier ,1979
- Complexity of Scheduling under Precedence ConstraintsOperations Research, 1978