Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs

References

• Afentakis P., Gavish B. Optimal lot-sizing for complex product structures. Oper. Res. (1986) 34:237–249Link, Google Scholar
• Balas E. The prize collecting traveling salesman problem. Networks (1989) 19:621–636Crossref, Google Scholar
• Barany I., Van Roy T. J., Wolsey L. A. Strong formulations for multi-item capacitated lot-sizing. Management Sci. (1984) 30:1255–1261Link, Google Scholar
• Belvaux G.Modelling and solving lot-sizing problems by mixed-integer programming (1999) (Faculté des Sciences Appliquées, Université Catholique de Louvain, Belgium) . Ph.D. thesisGoogle 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
• Belvaux G., Wolsey L. A.LOTSIZELIB: A library of lot-sizing models and matricesAvailable at http://www.core.ucl.ac.be/wolsey/Lotsizel.htmGoogle Scholar
• Cattrysse D., Maes J., van Wassenhove L. N. Set partitioning and column generation heuristics for capacitated dynamic lot-sizing. Eur. J. Oper. Res. (1990) 46:38–47Crossref, Google Scholar
• Cattrysse D., Salomon M., Kuik R., van Wassenhove L. N. A dual ascent and column generation heuristic for the DLSP with setup times. Management Sci. (1993) 39:477–486Link, Google Scholar
• The CHES problems (1989) (Chesapeake Decision Sciences, Inc., New Providence, NJ) Google 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 production (1995) (Department of Mathematics, Université Catholique de Louvain, Belgium) . Ph.D thesisGoogle Scholar
• Constantino M. A cutting plane approach to capacitated lot-sizing with start-up costs. Math. Programming (1996) 75:353–376Crossref, Google Scholar
• Cordier C., Marchand H., Laundry R., Wolsey L. A. bc-opt: A branch-and-cut code for mixed-integer programs. Math. Programming (1999) 86:335–354Crossref, Google Scholar
• Diaby M., Bahl H. C., Karwan M. H., Zionts S. A lagrangean relaxation approach for very large scale capacitated lot-sizing. Management Sci. (1992) 38:1329–1339Link, Google Scholar
• Dixon P. S., Silver E. A. A heuristic solution procedure for the multi-item, single level, limited capacity lot-siizng problem. J. Oper. Management (1981) 2:23–39Crossref, Google Scholar
• Eppen G. D., Martin R. K. Solving multi-item lot-sizing problems using variable redefinition. Oper. Res. (1987) 35:832–848Link, Google Scholar
• Fleischmann B. The discrete lot-sizing and scheduling problem with sequence-dependent setup costs. Eur. J. Oper. Res. (1994) 75:395–404Crossref, Google Scholar
• Kang S., Malik K., Thomas L. J. Lotsizing and scheduling in parallel machines with sequence-dependent setup costs. Management Sci. (1999) 45:273–289Link, Google Scholar
• Karmarkar U. S., Schrage L. S. The deterministic dynamic product cycling problem. Oper. Res. (1985) 33:326–345Link, Google Scholar
• MEMIPS. Model enhanced solution methods for integer programming software (1997) . Esprit Project 20118, Public report reference DR1.1.10Google Scholar
• Nemhauser G. L., Wolsey L. A.Integer and Combinatorial Optimization (1988) (John Wiley and Sons, New York) Crossref, Google Scholar
• PAMIPS. Development of parallel algorithms and software for mixed-integer programming in industrial schedulingEsprit Project 8755, Public report reference DR4.3.5Google 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. Lot-sizing with constant batches: Formulation and valid inequalities. Math. Oper. Res. (1993) 18:767–785Link, Google Scholar
• Pochet Y., Wolsey L. A., Cook W., Lovasz L., Seymour P. Algorithms and reformulations for lot-sizing problems. Combinatorial Optimization (1995) 245–294DIMACS Series in Discrete Mathematics and Computer ScienceCrossref, Google Scholar
• Pochet Y., Wolsey L. A.Adding flexibility in lot-sizing models: Minimum batch sizes and cleaning times (1996) (Belgium). Workshop on Production Planning and Control, FUCAM, MonsGoogle Scholar
• Savelsbergh M. W. P., Nemhauser G. L.Functional description of MINTO, a mixed-integer optimizer (1993) (Georgia Institute of Technology, Atlanta, Georgia) . Report COC-91-03AGoogle Scholar
• Simpson N. C., Erenguc S. S. Improved heuristic methods for multiple stage production planning. Comp. Oper. Res. (1998a) 25:611–623Crossref, Google Scholar
• Simpson N. C., Erenguc S. S.Production planning in multiple stage manufacturing environments with joint costs, limited resources and set-up times (1998b) (Department of Management Science and Systems, University of Buffalo, Buffalo, NY) . Technical reportGoogle Scholar
• Tempelmeier H., Derstroff M. A lagrangean-based heuristic for dynamic multilevel multiitem constrained lotsizing with setup times. Management Sci. (1996) 42:738–757Link, Google Scholar
• Thizy J. M., van Wassenhove L. N. Lagrangean relaxation for the multi-item capacitated lot-sizing problem. IIE Trans. (1985) 17:308–313Crossref, Google Scholar
• Vanderbeck F. Lot-sizing with start-up times. Management Sci. (1998) 44:1409–1425Link, Google Scholar