A General Heuristic for Production Planning Problems

References

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