A general heuristic for production planning problems

INFORMS Journal on Computing

Volumn 16, Issue 3, 2004, Pages 316-327

  Pochet, Yves ^a   Van Vyve, Mathieu ^a  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

Branch and cut; Heuristic; Multilevel; Production planning; Setup times

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; INTEGER PROGRAMMING; MATHEMATICAL MODELS; OPTIMIZATION; PROBABILITY; PRODUCTION CONTROL; PRODUCTIVITY; STRATEGIC PLANNING;

BRANCH AND CUT; MULTILEVEL; PRODUCTION PLANNING; SETUP TIMES;

HEURISTIC METHODS;

EID: 4544362972     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1030.0042     Document Type: Article

References (30)

1. Arkin, E., D. Joneja, R. Roundy. 1989. Computational complexity of uncapadtated multi-echelon production planning problems. Oper. Res. Lett. 8 61-66.
2. Belvaux, G. 1999. Modelling and solving lot-sizing problems by mixed integer programming. Ph.D. thesis, Faculté des Sciences Appliquées, Université Catholique de Louvain, Louvain-la-Neuve, Belgium.
3. Belvaux, G., L. A. Wolsey. 1998. Lotsizelib: A library of lot-sizing models and matrices, http://www.core.ucl.ac.be/wolsey/Lotsizel.htm.
4. Belvaux, G., L. A. Wolsey. 2000. bc-prod: A specialized branch-and-cut system for lot-sizing problems. Management Sci. 46 724-738.
5. Bixby, R. E., S. Ceria, C. M. McZeal, M. W. P. Savelsbergh. 1998. An updated mixed integer programming library: MIPLIB 3.0. Optima 58 12-15. Problems available at http://www.caam.rice.edu/~bixby/miplib/miplib.html.
6. Clark, A. J., H. Scarf. 1960. Optimal policies for multi-echelon inventory problems. Management Sci. 6 475-490.
7. Constantino, M. 1995. A polyhedral approach to production planning models: Start-up costs and times, and lower bounds on prodution. Ph.D. thesis, Faculté des Sciences, Université Catholique de Louvain, Louvain-la-Neuve, Belgium.
8. Constantino, M. 1996. A cutting plane approach to capacitated lot-sizing with startup costs. Math. Programming 75 353-376.
9. Constantino, M. 1998. Lower bounds in lot-sizing models: A polyhedral study. Math. Oper. Res. 23 101-118.
10. Cordier, C. 1999. Development and experimentation with a branch & cut system for mixed integer programming. Ph.D. thesis, Faculté des Sciences Appliquées, Université Catholique de Louvain, Louvain-la-Neuve, Belgium.
11. Dash Associates. 1999a. XPRESS-MP Optimisation Subroutine Library, Reference Manual, Release 11. Blisworth House, Blisworth, Northants NN73BX U.K.
12. Dash Associates. 1999b. XPRESS-MP, Reference Manual, Release 11. Blisworth House, Blisworth, Northants NN73BX, U.K.
13. Guisewite, G. M., P. Pardalos. 1990. Minimum concave-cost network flow problems. Ann. Oper. Res. 25 75-100.
14. Harrison, T. P., H. S. Lewis. 1996. Lot sizing in serial assembly systems with multiple constrained resources. Management Sci. 42 19-36.
15. Hochbaum, D., A. Segev. 1989. Analysis of a flow problem with fixed charges. Networks 19 291-312.
16. Katok, E., H. S. Lewis, T. P. Harrison. 1998. Lot sizing in general assembly systems with setup costs, setup times, and multiple constrained resources. Management Sci. 44 859-877.
17. Kim, D., P. M. Pardalos. 1999. A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure. Oper. Res. Lett. 24 195-203.
18. Klingman, D., A. Napier, J. Stutz. 1974. Netgen: A program for generating large scale capacitated assignment, transportation, and minimum-cost flow network problems. Management Sci. 20 814-820.
19. Koch, T., A. Martin. 1998. Solving Steiner tree problems in graphs to optimality. Networks 32 207-232.
20. Koch, T., A. Martin, S. Voss. 2000. SteinLib: An updated library on Steiner tree problems in graphs. ZIB-Report 00-37, Konrad-Zuse-Zentrum für Informationstechnik Berlin, Berlin, Germany. Problems available at http://elib.zib.de/steinlib.
21. Kuik, R., M. Salomon, L. N. van Wassenhove. 1994. Batching decisions: Structure and models. Eur. J. Oper. Res. 75 243-263.
22. Maes, J., J. O. McClain, L. N. van Wassenhove. 1991. Multilevel capacitated lotsizing complexity and lp-based heuristics. Eur. J. Oper. Res. 53 131-148.
23. Mehlhorn, K., S. Näher, M. Seel, C. Uhrig. 2000. The LEDA User Manual, Version 4.1. http://www.mpi-sb.mpg.de/LEDA/MANUAL/MANUAL.html.
24. Meyr, H. 2000. Simultaneous lotsizing and scheduling by combining local search with dual reoptimization. Eur. J. Oper. Res. 120 311-326.
25. Miller, A. J., G. L. Nemhauser, M. W. P. Savelsbergh. 2000. Solving multi-item capacitated lot-sizing problems with setup times by branch-and-cut. CORE DP 2000/39, CORE, Université Catholique de Louvain, Louvain-la-Neuve, Belgium.
26. Ortega, F., L. A. Wolsey. 2003. A branch-and-cut algorithm for the single commodity uncapacitated fixed charge network flow problem. Networks 41 143-158.
27. Pochet, Y., L. A. Wolsey. 1991. Solving multi-item lot-sizing problems using strong cutting planes. Management Sci. 37 53-67.
28. Pochet, Y., L. A. Wolsey. 1995. Algorithms and reformulations for lot sizing problems. W. Cook, L. Lovasz, P. Seymour, eds. DIMACS Ser. Discrete Math. Comput. Sci. No. 20. American Mathematical Society, Providence, RI. 245-293.
29. Simpson, N. C., S. S. Erenguc. 1998. Production planning in multiple stage manufacturing environments with joint costs, limited resources and set-up times. Technical report, Department of Management Science and Systems, University of Buffalo, Buffalo, NY.
30. Tempelmeier, H., M. Derstroff. 1996. A lagrangean-based heuristic for dynamic multilevel multi-item constrained lotsizing with setup times. Management Sci. 42 738-757.