MIP modelling of changeovers in production planning and scheduling problems

European Journal of Operational Research

Volumn 99, Issue 1, 1997, Pages 154-165

  Wolsey, Laurence A ^a  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

Cutting planes; Lot sizing; Machine scheduling; Mixed integer programming

Indexed keywords

COSTS; MACHINE TOOLS; MATHEMATICAL MODELS; PLANNING; PRODUCTION; SCHEDULING;

CHANGEOVERS; CUTTING PLANES; LOT SIZING; MACHINE SCHEDULING; MIXED INTEGER PROGRAMMING;

INTEGER PROGRAMMING;

EID: 0031139978     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(97)89646-4     Document Type: Article

References (31)

1. E. Balas, New classes of efficiently solvable generalized traveling salesman problems, MSSR-611, GSIA, Carnegie Mellon University, March 1995.
2. E. Balas, N. Simonetti, An efficient algorithm for a class of precedence constrained TSPs and its use as a heuristic for the standard TSP, GSIA, Carnegie Mellon University (in preparation).
3. J.F. Benders, Partitioning procedures for solving mixed variables programming problems, Numerische Mathematik 4 (1962) 238-252.
4. N. Christofides, A. Mingozzi, P. Toth, Exact algorithms for the vehicle routing problem based on spanning tree and shortest path relaxations, Mathematical Programming 20 (1980) 255-282.
5. N. Christofides, A. Mingozzi, P. Toth, State space relaxation procedures for the computation of bounds to routing problems, Networks 11 (1981) 145-164.
6. M. Constantino, A cutting plane approach to capacitated lot-sizing with start-up costs, Mathematical Programming 75 (1996) 353-376.
7. M. Constantino, A polyhedral approach to production planning models: start-up costs and times, upper and lower bounds on production, Ph.D. Thesis, Faculté des Sciences, Université Catholique de Louvain, Belgium, 1995.
8. J. Desrosiers, Y. Dumas, M.M. Solomon, F. Soumis, Time constrained routing and scheduling, in: M.O. Ball, T.L. Magnanti, C.L. Monma, G.L. Nemhauser (Eds.), Network Routing, Handbooks in Operations Research and Management Science, vol. 8, North-Holland, Amsterdam, 1995.
9. Z. Gu, G.L. Nemhauser, M.W.P. Savelsbergh, Lifted cover inequalities for 0-1 integer programs I: computation, COC-94-09, School of Industrial and Systems Engineering, Georgia Institute of Technology, October 1994.
10. M. Held, R.M. Karp, A dynamic programming approach to sequencing problems, Journal of the Society of Industrial and Applied Mathematics 10 (1962) 196-210.
11. D.J. Houck, J.-C. Picard, M. Queyranne, R.R. Vemuganti, The travelling salesman problem as a constrained shortest path problem: theory and computational experience, Opsearch 17 (1980) 93-109.
12. J. Kallrath, Y. Pochet, S. Raucq, Production network planning system, PAMIPS Report, Esprit Project 8755, November 1994.
13. U.S. Karmarkar, L. Schrage, The deterministic dynamic product cycling problem, Operations Research 33 (1985) 326-345.
14. E. Kondili, C.C. Pantelides, R.W.H. Sargent, A general algorithm for short-term scheduling of batch operations -I. MILP formulation, Computers and Chemical Engineering 17 (1993) 211-227.
15. J.B. Lasserre, M. Queyranne, Generic scheduling polyhedra and a new mixed integer formulation for single-machine scheduling, in: E. Balas, G. Cornuéjols, R. Kannan (Eds.), Proceedings of IPCO, 1992, pp. 136-149.
16. Y. Lee, H.F. Sherali, Unrelated machine scheduling with time-window and machine-downtime constraints: an application to a naval battle-group problem, in: N. Maculan, C.C. Ribeiro (Eds.), Applications of Operations Research, Annals of Operations Research 50 (1994) 339-365.
17. A. Levin, Scheduling and fleet routing models for transportation systems, Transportation Science 5 (1971) 232-255.
18. T.M. Magnanti, R. Vachani, A strong cutting plane algorithm for production scheduling with changeover costs, Operations Research 38 (1990) 456-473.
19. Y. Pochet, L.A. Wolsey, Solving multi-item lot-sizing problems using strong cutting planes, Management Science 37 (1991) 53-67.
20. Y. Pochet, L.A. Wolsey, Time-indexed formulations of a nonlinear project scheduling problem, CORE, Université Catholique de Louvain, June 1995.
21. A.A.B. Pritsker, L.J. Watters, P.M. Wolfe, Multiproject scheduling with limited resources: a zero-one programming approach, Management Science 16 (1969) 93-99.
22. H.N. Psaraftis, A dynamic programming approach for sequencing groups of identical jobs, Operations Research 28 (1980) 1347-1359.
23. N. Shah, C.C. Pantelides, R.W.H. Sargent, A general algorithm for short-term scheduling of batch operations - II. computational issues, Computers and Chemical Engineering 17 (1993) 229-244.
24. H.D. Sherali, Y. Lee, D.B. Boyer, Scheduling target illuminators in naval battle-group anti-air warfare, Naval Research Logistics Quarterly 42 (1995) 737-755.
25. J. Sousa, Time-indexed formulations of non-preemptive single machine scheduling problems, Ph.D. Thesis, Faculty of Applied Sciences, Université Catholique de Louvain, June 1989.
26. J. Sousa, L.A. Wolsey, Time-indexed formulations of non-preemptive single machine scheduling problems, Mathematical Programming 54 (1992) 353-367.
27. M. van den Akker, LP-based solution methods for single-machine scheduling problems, Ph.D. Thesis, Technical University of Eindhoven, December 1994.
28. R.J. Vander Wiel, N.V. Sahinidis, An exact approach for the time-dependent travelling salesman problem, Department of Mechanical and Industrial Engineering, University of Illinois, September 1994.
29. S. van Hoesel, A. Wagelmans, L.A. Wolsey, Economic lot-sizing with start-up costs: the convex hull, SIAM Journal on Discrete Mathematics 7 (1994) 141-151.
30. L.A. Wolsey, Uncapacitated lot-sizing problems with start-up costs, Operations Research 37 (1989) 741-747.
31. L.A. Wolsey, Valid inequalities for mixed integer programs with generalised and variable upper bound constraints, Discrete Applied Mathematics 25 (1990) 251-261.