The relation of time indexed formulations of single machine scheduling problems to the node packing problem

Mathematical Programming, Series B

Volumn 93, Issue 3, 2002, Pages 477-494

  Waterer, H ^a   Johnson, E L ^b   Nobili, P ^c   Savelsbergh, M W P ^b  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

^b Georgia Institute of Technology   (United States)

^c CNR   (Italy)

Author keywords

Facet defining graphs; Facet inducing inequalities; Lifted valid inequalities; Node packing; Polyhedral methods; Scheduling

Indexed keywords

GRAPH THEORY; MATHEMATICAL PROGRAMMING; PARAMETER ESTIMATION; SCHEDULING; VECTORS;

FACET DEFINING GRAPHS; FACET INDUCING INEQUALITIES; LIFTED VALID INEQUALITIES; NODE PACKING; POLYHEDRAL METHODS;

PROBLEM SOLVING;

EID: 21244468469     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10107-002-0335-9     Document Type: Article

References (24)

1. Ahuja, R. K., Magnanti, T. L., and Orlin, J. B. (1993). Network flows: Theory, Algorithms, and Applications. Prentice Hall.
2. Atamtürk, A., Nemhauser, G. L., and Savelsbergh, M. W. P. (2000). Conflict graphs in solving integer programming problems. European Journal of Operational Research, 121, 40-55.
3. Balas, E. (1985). On the facial structure of scheduling polyhedra. Mathematical Programming Study, 24, 179-218.
4. Bixby, R. E. and Lee, E. K. (1998). Solving a truck dispatching scheduling problem using branch-and-cut. Operations Research, 46, 355-367.
5. Borndörfer, R. and Weismantel, R. (2000). Set packing relaxations of some integer programs. Mathematical Programming, 88, 425-450.
6. Christof, T. and Löbel, A. (1997). PORTA: A POlyhedron Representation Transformation Algorithm, http://www.zib.de/Optimization/ Software/Porta/.
7. Crama, Y. and Spieksma, F. C. R. (1996). Scheduling jobs of equal length: complexity, facets and computational results. Mathematical Programming, 72, 207-227.
8. Dash Associates (2001). XPRESS-MP Users Guide, Release 13.
9. Galluccio, A. and Sassano, A. (1997). The rank facets of the stable set polytope for claw-free graphs. Journal of Combinatorial Theory, B69, 1-38.
10. Golumbic, M. C. (1980). Algorithmic Graph Theory and Perfect Graphs. Academic Press.
11. Gomory, R. E. (1969). Some polyhedra related to combinatorial problems. Linear Algebra and its Applications, 2, 451-558.
12. Hammer, P. L., Johnson, E. L., and Peled, U. N. (1975). Facets of regular 0-1 polytopes. Mathematical Programming, 8, 179-206.
13. Hoffman, K. L. and Padberg, M. (1993). Solving airline crew scheduling problems by branch-and-cut. Management Science, 39, 657-682.
14. ILOG, Inc. (2001). ILOG CPLEX 7.5, User Manual.
15. Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G., and Shmoys, D. B. (1993). Sequencing and scheduling: Algorithms and complexity. In Graves, S. C., Rinnooy Kan, A. H. G., and Zipkin, P. H. (Eds.), Logistics of Production and Inventory, volume 4 of Handbooks in Operations Research and Management Science, pages 445-522. North Holland.
16. Nernhauser, G. L. and Trotter, L. E. (1974). Properties of vertex packing and independence system polyhedra. Mathematical Programming, 6, 48-61.
17. Nemhauser, G. L. and Wolsey, L. A. (1988). Integer and Combinatorial Optimization. John Wiley and Sons.
18. Padberg,M. (1973). On the facial structure of set packing polyhedra. Mathematical Programming, 5, 199-215.
19. Padberg, M. (1977). On the complexity of set packing polyhedra. Annals of Discrete Mathematics, 1, 421-434.
20. Queyranne, M. and Schulz, A. S. (1994). Polyhedral approaches to machine scheduling. Preprint 408/1994, Department of Mathematics, Technische Universität Berlin. Revised in June 1997.
21. Sousa, J. P. and Wolsey, L. A. (1992). A time indexed formulation of non-preemptive single machine scheduling problems. Mathematical Programming, 54, 353-367.
22. Spieksma, F. C. R. (1999). On the approximability of an interval scheduling problem. Journal of Scheduling, 2, 215-227.
23. Van den Akker, J. M. (1994). LP-based solution methods for single-machine scheduling problems. PhD thesis, Technische Universiteit Eindhoven.
24. Van den Akker, J. M., Van Hoesel, S., and Savelsbergh, M. W. P. (1999). A polyhedral approach to single-machine scheduling problems. Mathematical Programming, 85, 541-572.