On the approximability of average completion time scheduling under precedence constraints

Discrete Applied Mathematics

Volumn 131, Issue 1, 2003, Pages 237-252

  Woeginger, Gerhard J ^a,b  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

Approximability threshold; Approximation algorithms; Bipartite order; Interval order; Precedence constraints; Scheduling

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; LINEAR PROGRAMMING; PROBLEM SOLVING; SCHEDULING;

INTERVAL ORDER;

POLYNOMIAL APPROXIMATION;

EID: 0042863253     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(02)00427-4     Document Type: Conference Paper

References (16)

1. Chekuri C., Motwani R. Precedence constrained scheduling to minimize sum of weighted completion times on a single machine. Discrete Appl. Math. 98:1999;29-38.
2. Chudak F., Hochbaum D.S. A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine. Oper. Res. Lett. 25:1999;199-204.
3. Dyer M.E., Wolsey L.A. Formulating the single machine sequencing problem with release dates as a mixed integer program. Discrete Appl. Math. 26:1990;255-270.
4. Goemans M.X., Williamson D.P. Two-dimensional Gantt charts and a scheduling algorithm of Lawler. SIAM J. Discrete Math. 13:2000;281-294.
5. Graham R.L., Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G. Optimization and approximation in deterministic sequencing and scheduling. a survey Ann. Discrete Math. 5:1979;287-326.
6. Hall L.A., Schulz A.S., Shmoys D.B., Wein J. Scheduling to minimize average completion time. off-line and on-line approximation algorithms Math. Oper. Res. 22:1997;513-544.
7. Lawler E.L. Sequencing jobs to minimize total weighted completion time subject to precedence constraints. Ann. Discrete Math. 2:1978;75-90.
8. Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G., Shmoys D.B. Sequencing and scheduling: algorithms and complexity. Graves S.C., Rinnooy Kan A.H.G., Zipkin P.H. Logistics of Production and Inventory. Handbooks in Operations Research and Management Science. Vol. 4:1993;445-522 North-Holland, Amsterdam.
9. Lenstra J.K., Rinnooy Kan A.H.G. Complexity of scheduling under precedence constraints. Oper. Res. 26:1978;22-35.
10. F. Margot, M. Queyranne, Y. Wang, Decompositions, network flows, and a precedence constrained single machine scheduling problem, Report #2000-29, Department of Mathematics, University of Kentucky, Lexington, 1997.
11. Martello S., Toth P. Knapsack Problems: Algorithms and Computer Implementations. 1990;Wiley, England.
12. Möhring R.H. Computationally tractable classes of ordered sets. Rival I. Algorithms and Order. 1989;105-193 Kluwer Academic Publishers, Dordrecht.
13. Potts C.N. An algorithm for the single machine sequencing problem with precedence constraints. Math. Programming Stud. 13:1980;78-87.
14. Schuurman P., Woeginger G.J. Polynomial time approximation algorithms for machine scheduling. ten open problems J. Scheduling. 2:1999;203-213.
15. Sidney J.B. Decomposition algorithms for single-machine sequencing with precedence relations and deferral costs. Oper. Res. 23:1975;283-298.
16. Spinrad J., Brandstädt A., Stewart L. Bipartite permutation graphs. Discrete Appl. Math. 18:1987;279-292.