Half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine

Operations Research Letters

Volumn 25, Issue 5, 1999, Pages 199-204

  Chudak, Fabián A ^a   Hochbaum, Dorit S ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; LINEAR PROGRAMMING; SCHEDULING;

HALF-INTEGRAL LINEAR PROGRAMMING;

PRODUCTION CONTROL;

EID: 0033358135     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(99)00056-5     Document Type: Article

References (16)

1. Von Arnim A., Faigle U., Schrader R. The permutahedron of series-parallel posets. Discrete Appl. Math. 28:1990;3-9.
2. C. Chekuri, R. Motwani, Precedence constrained scheduling to minimize weighted completion time on a single machine, Discrete Appl. Math., to appear.
3. D. Coppersmith, S. Winograd, Matrix computations via arithmetic progressions, Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987, pp. 1-6.
4. Goldberg A.V., Tarjan R.E. A new approach for the maximum flow problem. J. ACM. 35:1988;921-940.
5. Graham R.L., Lawler E.L., Lenstra J.K., Rinnoy Kan A.H.G. Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math. 5:1979;287-326.
6. L.A. Hall, A.S. Schulz, D.B. Shmoys, J. Wein, Scheduling to minimize average completion time: off-line and on-line approximation algorithms, Math. Oper. Res., to appear.
7. Hochbaum D.S., Meggido N., Naor J., Tamir A. Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality. Math. Programming. 62:1993;69-83.
8. Lawler E.L. Sequencing jobs to minimize total weighted completion time subject to precedence constraints. Ann. Discrete Math. 2:1978;75-90.
9. F. Margot, M. Queyranne, Y. Wang, Decompositions, network flows and a precedence constrained single machine problem, Working paper, 1997.
10. Potts C.N. An algorithm for the single machine sequencing problem with precedence constraints. Math. Programming Stud. 13:1980;78-87.
11. Queyranne M. Structure of a simple scheduling polyhedron. Math. Programming. 58:1993;263-285.
12. M. Queyranne, A.S. Schulz, Polyhedral approaches to machine scheduling, Report No 408 / 1994, Fachbereich Mathematik, Technische Universitt Berlin, 1994.
13. A.S. Schulz, private communication, June 1997.
14. P.M. Vaidya, A new algorithm for minimizing convex functions over convex sets, Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, 1989, pp. 338-343.
15. P.M. Vaidya, Speeding-up linear programming using fast matrix multiplication, Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, 1989, pp. 332-337.
16. L.A. Wolsey, Formulating single machine scheduling problems with precedence constraints, in: J.J. Gabsewicz, J.F. Richard, L.A. Wolsey (Eds.), Economic Decision Making: Games, Econometrics and Optimisation, Contributions in Honour of Jacques Dreze, North-Holland, Amsterdam, 1990, pp. 473-484.