A polyhedral approach to single-machine scheduling problems

Mathematical Programming, Series B

Volumn 85, Issue 3, 1999, Pages 541-572

  Van Den Akker, J M ^a   Van Hoesel, C P M ^b   Savelsbergh, M W P ^c  

^a NATIONAL AEROSPACE LABORATORY NLR   (Netherlands)

^b MAASTRICHT UNIVERSITY   (Netherlands)

^c Georgia Institute of Technology   (United States)

Author keywords

Branch and cut; Facet inducing inequalities; Polyhedral methods; Scheduling; Separation

Indexed keywords

EID: 0004209572     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10107990047a     Document Type: Article

References (15)

1. van den Akker, J.M. (1994): LP-based solution methods for single-machine scheduling problems. PhD Thesis, University of Technology Eindhoven
2. van den Akker, J.M., Hurkens, C.A.J., Savelsbergh, M.W.P. (1995): Column generation for single-machine scheduling problems. INFORMS J. Comput., to appear
3. Balas, E. (1985): On the facial structure of scheduling polyhedra. Math. Program. Study 24, 179-218
4. Belouadah, H., Posner, M.E., Potts, C.N. (1992): Scheduling with release dates on a single machine to minimize total weighted completion time. Discrete Appl. Math. 36, 213-231
5. Crama, Y., Spieksma, F.C.R. (1996): Scheduling jobs of equal length: complexity and facets. Math. Program. 72, 207-227
6. CPLEX Optimization, Inc. (1994): Using the CPLEX Callable Library, Version 3.0
7. Crowder, H., Johnson, E.L., Padberg, M.W. (1983): Solving large-scale zero-one linear programming problems. Oper. Res. 31, 803-834
8. Dyer, M.E., Wolsey, L.A. (1990): Formulating the single machine sequencing problem with release dates as a mixed integer program. Discrete Appl. Math. 26, 255-270
9. Goemans, M.X., Queyranne, M., Schulz, A.S., Skutella, M., Wang, Y. (1999): Single Machine Scheduling with Release Dates. Manuscript
10. Hall, L.A., Schulz, A.S., Shmoys, D.B., Wein, J. (1997): Scheduling to minimize average completion time: Off-line and on-line approximation algorithms. Math. Oper. Res. 22, 513-544
11. Hammer, P.L., Johnson, E.L., Peled, U.N. (1975): Facets of regular 0-1 polytopes. Math. Program. 8, 179-206
12. Huffman, K.L., Padberg, M.W. (1985): LP-based combinatorial problem solving. Ann. Oper. Res. 4, 145-194
13. Lasserre, J.B., Queyranne, M. (1992): Generic scheduling polyhedra and a new mixed-integer formulation for single-machine scheduling. In: Balas, E., Comuéjols, G., Kannan, R., eds., Integer Programming and Combinatorial Optimization, Proceedings of the IPCO-Conference held at Carnegie Mellon University. University Printing and Publications, Carnegie Mellon University, Pittsburgh
14. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B. (1993): Sequencing and scheduling: Algorithms and complexity. In: Graves, S.C., et al., eds., Handbooks in Operations Research and Management Science, Vol. 4., pp. 445-522 North-Holland, Amsterdam
15. Lenstra, J.K., Rinnooy Kan, A.H.G., Brucker, P. (1977): Complexity of machine scheduling problems. Ann. Discrete Math. 1, 343-362