Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups

Computers and Operations Research

Volumn 25, Issue 5, 1998, Pages 351-366

  Ríos Mercado, Roger Z ^a   Bard, Jonathan F ^b  

^a Texas AandM University   (United States)

^b UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; CONSTRAINT THEORY; INTEGER PROGRAMMING; MATHEMATICAL MODELS; PROBLEM SOLVING; PROCESS CONTROL; PRODUCTION CONTROL; SCHEDULING; TRAVELING SALESMAN PROBLEM;

BRANCH-AND-CUT ALGORITHMS; FLOWSHOP SCHEDULING;

FLEXIBLE MANUFACTURING SYSTEMS;

EID: 0032068389     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(97)00079-8     Document Type: Article

References (21)

1. Balas, E., The asymmetric assignment problem and some new facets of the traveling salesman polytope on a directed graph. SIAM Journal on Discrete Mathematics, 1989, 2, 4 425-451.
2. Balas, E. and Fischetti, M., The fixed-outdegree 1-arborescence polytope. Mathematics of Operations Research, 1992, 17, 4 1001-1018.
3. Balas, E. and Fischetti, M., A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets. Mathematical Programming, 1993, 58, 3 325-352.
4. CPLEX Optimization, Inc. Incline Village, NV. Using the CPLEX Callable Library, Version 4.0, 1995.
5. Crowder, H. and Padberg, M. W., Solving large-scale asymmetric traveling salesman problems to optimality. Management Science, 1980, 26, 5 495-509.
6. Fischetti, M., Facets of the asymmetric traveling salesman polytope. Mathematics of Operations Research, 1991, 16, 1 42-56.
7. Fischetti, M. and Toth, P., A polyhedral approach for the exact solution of hard ATSP instances. Management Science, forthcoming, 1997.
8. Gomory, R. E. and Hu, T. C., Multi-terminal network flows. SIAM Journal on Applied Mathematics, 1961, 9, 551-570.
9. Grötschell, N. and Padběrg, M. W., Polyhedral theory. In E. L. Lawler, J. K. Lenstra, A. H. G. Rinnoy Kan and D. B. Shmoys, editors, The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. John Wiley & Sons, Chichester, 1985, pp. 251-305.
10. Gupta, J. N. D. and Darrow, W. P., The two-machine sequence dependent flowshop scheduling problem. European Journal of Operational Research, 1986, 24, 3 439-446.
11. Nemhauser, G. L., Savelsbergh, M. W. P. and Sigismondi, G. C., MINTO, a Mixed INTeger Optimizer. Operations Research Letters, 1994, 15, 48-59.
12. Padberg, M. and Rinaldi, G., An efficient algorithm for the minimum capacity cut problem. Mathematical Programming, 1990, 47, 1 19-36.
13. Padberg, M. and Rinaldi, G., A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Review, 1991, 33, 1 60-100.
14. Pinedo, M., Scheduling: Theory, Algorithms, and Systems. Prentice-Hall, Englewood Cliffs, New Jersey, 1995.
15. Queyranne, M. and Wang, Y., Symmetric inequalities and their composition for asymmetric travelling salesman polytopes. Mathematics of Operations Research, 1995, 20, 4 838-863.
16. Ríos-Mercado, R. Z. and Bard, J. F., The flowshop scheduling polyhedron with setup times. Technical Report ORP96-07, Graduate Program in Operations Research, University of Texas, Austin, TX 78712-1063, July, 1996.
17. Ríos-Mercado, R. Z. and Bard, J. F., Heuristics for the flow line problem with setup costs. European Journal of Operational Research, forthcoming, 1998.
18. Savelsbergh, M. W. P., Preprocessing and probing techniques for mixed integer programming problems. ORSA Journal on Computing, 1994, 6, 4 445-454.
19. Simons, J. V.Jr., Heuristics in flow shop scheduling with sequence dependent setup times. OMEGA, 1992, 20, 2 215-225.
20. Srikar, B. N. and Ghosh, S., A MILP model for the n-job, m-stage flowshop with sequence dependent set-up times. International Journal of Production Research, 1986, 24, 6 1459-1474.
21. Stafford, E. F. and Tseng, F. T., On the Srikar-Ghosh MILP model for the N × M SDST flowshop problem. International Journal of Production Research, 1990, 28, 10 1817-1830.