On the approximability of average completion time scheduling under precedence constraints
Author:
- 1 September 2003
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 131 (1) , 237-252
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Two-Dimensional Gantt Charts and a Scheduling Algorithm of LawlerSIAM Journal on Discrete Mathematics, 2000
- A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machineOperations Research Letters, 1999
- Precedence constrained scheduling to minimize sum of weighted completion times on a single machineDiscrete Applied Mathematics, 1999
- Polynomial time approximation algorithms for machine scheduling: ten open problemsJournal of Scheduling, 1999
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation AlgorithmsMathematics of Operations Research, 1997
- Formulating the single machine sequencing problem with release dates as a mixed integer programDiscrete Applied Mathematics, 1990
- An algorithm for the single machine sequencing problem with precedence constraints1980
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey1979
- Complexity of Scheduling under Precedence ConstraintsOperations Research, 1978
- Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints1978