Decompositions, network flows, and a precedence constrained single-machine scheduling problem

Operations Research

Volumn 51, Issue 6, 2003, Pages 981-992

  Margot, François ^a   Queyranne, Maurice ^b   Wang, Yaoguang ^c  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^c PeopleSoft Inc   (United States)

Author keywords

Network graphs, flow algorithms: parametric flows and sidney decompositions; Production scheduling, approximations: 2 approximation algorithm; Programming, integer, algorithms, relaxation subgradient: integer formulation

Indexed keywords

NETWORK FLOWS; OPTIMAL SCHEDULES; OPTIMAL SOLUTIONS;

ALGORITHMS; APPROXIMATION THEORY; CALCULATIONS; DECOMPOSITION; HEURISTIC METHODS; LINEAR PROGRAMMING; MATHEMATICAL PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING; VECTORS;

SCHEDULING;

EID: 4344662655     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.51.6.981.24912     Document Type: Article

References (26)

1. Ahuja, R. K., T. L. Magnanti, J. B. Orlin. 1993. Network Flows. Prentice Hall, Englewood Cliffs, NJ.
2. Balas, E. 1985. On the facial structure of scheduling polyhedra. Math. Programming Study 24 179-218.
3. Chekuri, C., R. Motwani. 1999. Precedence constrained scheduling to minimize sum of weighted completion times on a single machine. Discrete Appl. Math. 98 29-38.
4. Davey, B. A., H. A. Priestley. 1990. Introduction to Lattices and Order. Cambridge University Press, Cambridge, U.K.
5. Gallo, G., M. D. Grigoriadis, R. E. Tarjan. 1989. A fast parametric maximum flow algorithm and applications. SIAM J. Comput. 18 30-55.
6. Goemans, M. X., M. Queyranne, A. S. Schulz, M. Skutella, Y. Wang. 2002. Single machine scheduling with release dates. SIAM J. Discrete Math. 15 165-192.
7. Goldfarb, D., M. D. Grigoriadis. 1988. A computational comparison of the dinic and network simplex methods for maximum flow. Ann. Oper. Res. 13 83-123.
8. Grätzer, G. 1978. General Lattice Theory. Academic Press, New York.
9. Hall, L. A., A. S. Schulz, D. B. Shmoys, J. Wein. 1997. Scheduling to minimize average completion time: Off-line and online approximation algorithms. Math. Oper. Res. 22 513-544.
10. Hoogeveen, J. A., S. L. Van de Velde. 1996. Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems. Math. Programming 70 173-190.
11. Hu, T. C. 1970. Integer Programming and Network Flows. Addison-Wesley, Reading, MA.
12. Lawler, E. L. 1976. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, New York.
13. _. 1978. Sequencing jobs to minimize total weighted completion time subject to precedence constraints. Ann. Discrete Math. 2 75-90.
14. _, J. K. Lenstra, A. H. G. Rinnooy Kan, D. B. Shmoys. 1993. Sequencing and scheduling: algorithms and complexity. S. C. Graves, A. H. G. Rinnooy Kan, P. H. Zipkin, eds. Logistics of Production and Inventory, Handbooks in Operations Research and Management Science, Vol. 4. North-Holland, Amsterdam, The Netherlands, 445-522.
15. McCormick, S. T. 1998. Fast algorithms for parametric scheduling come from extensions to parametric maximum flow. Oper. Res. 47 744-756.
16. Phillips, C., C. Stein, J. Wein. 1998. Minimizing average completion time in the presence of release dates. Math. Programming 82 199-223.
17. Picard, J.-C. 1976. Maximum closure of a graph and application to combinatorial problems. Management Sci. 22 1268-1272.
18. _, M. Queyranne. 1980. On the structure of all minimum cuts in a network and applications. Math. Programming Study 13 8-16.
19. Potts, C. N. 1985. A Lagrangean based branch-and-bound algorithm for single machine sequencing with precedence constraints to minimize total weighted completion time. Management Sci. 31 1300-1311.
20. Queyranne, M. 1993. Structure of a simple scheduling polyhedron. Math. Programming 58 263-285.
21. _, A. S. Schulz. 1996. Polyhedral approaches to machine scheduling. Report 408/1994, Department of Mathematics, University of Technology, Berlin, Germany. November 1994, revised October 1996.
22. _, Y. Wang. 1991a. Single-machine scheduling polyhedra with precedence constraints. Math. Oper. Res. 16 1-20.
23. _, _. 1991b. A cutting plane procedure for precedence-constrained single machine scheduling. Working paper, Faculty of Commerce, University of British Columbia, Vancouver, British Columbia, Canada, August.
24. Schulz, A. S. 1996. Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds. W. H. Cunningham, S. T. McCormick, M. Queyranne, eds. Integer Programming and Combinatorial Optimization. LNCS 1084, Springer, Berlin, Germany, 301-315.
25. Sidney, J. B. 1975. Decomposition algorithms for single-machine sequencing with precedence relations and deferral costs. Oper. Res. 23 283-298.
26. Wolsey, L. A. 1990. Formulating single machine scheduling problems with precedence constraints. J. J. Gabszewicz, J.-F. Richard, L. A. Wolsey, eds. Economic Decision-Making: Games, Econometrics and Optimisation. North-Holland, Amsterdam, The Netherlands, 473-484.