Solving Multi-Item Capacitated Lot-Sizing Problems with Setup Times by Branch-and-Cut

Instances of the multi-item capacitated lot-sizing problem with setup times (MCL) often appear in practice, either in standard form or with additional constraints, but they have generally been difficult to solve to optimality. In MCL demand for multiple items must be met over a time horizon, items compete for a shared capacity, and each setup uses up some of this capacity. In this paper we use results concerning the polyhedral structure of simplified models obtained from a single time period of MCL to obtain strong valid inequalities for MCL. To the best of our knowledge, these inequalities are the first to consider demand for multiple items and the joint capacity restriction simultaneously. We also discuss how to implement these inequalities successfully in a branch-and-cut algorithm. Our computational results suggest that our contributions represent significant progress in solving instances of MCL.

[1]  R. Gomory.  AN ALGORITHM FOR THE MIXED INTEGER PROBLEM , 1960 .

[2]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3]  Ellis L. Johnson,et al.  Solving Large-Scale Zero-One Linear Programming Problems , 1983, Oper. Res..

[4]  Laurence A. Wolsey,et al.  Uncapacitated lot-sizing: The convex hull of solutions , 1984 .

[5]  Laurence A. Wolsey,et al.  Valid Linear Inequalities for Fixed Charge Problems , 1985, Oper. Res..

[6]  Laurence A. Wolsey,et al.  Solving Mixed Integer Programming Problems Using Automatic Reformulation , 1987, Oper. Res..

[7]  Yves Pochet.  Valid inequalities and separation for capacitated economic lot sizing , 1988 .

[8]  William W. Trigeiro,et al.  Capacitated lot sizing with setup times , 1989 .

[9]  Thomas L. Magnanti,et al.  Facets and algorithms for capacitated lot sizing , 1989, Math. Program..

[10]  Laurence A. Wolsey,et al.  Multi-item lot-sizing problems using strong cutting planes , 1991 .

[11]  Harish C. Bahl,et al.  A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing , 1992 .

[12]  Laurence A. Wolsey,et al.  Lot-Sizing with Constant Batches: Formulation and Valid Inequalities , 1993, Math. Oper. Res..

[13]  Laurence A. Wolsey,et al.  Polyhedra for lot-sizing with Wagner—Whitin costs , 1994, Math. Program..

[14]  Miguel Constantino,et al.  A cutting plane approach to capacitated lot-sizing with start-up costs , 1996, Math. Program..

[15]  H. Tempelmeier,et al.  A Lagrangean-based heuristic for dynamic multilevel multiitem constrained lotsizing with setup times , 1996 .

[16]  Robert Weismantel,et al.  On the 0/1 knapsack polytope , 1997, Math. Program..

[17]  Laurence A. Wolsey,et al.  Lot-sizing problems: modelling issues and a specialized branch-and-cut system BC - PROD , 1998 .

[18]  Terry P. Harrison,et al.  Lot Sizing in General Assembly Systems with Setup Costs, Setup Times, and Multiple Constrained Resources , 1998 .

[19]  Miguel Constantino,et al.  Lower Bounds in Lot-Sizing Models: A Polyhedral Study , 1998, Math. Oper. Res..

[20]  Martin W. P. Savelsbergh,et al.  Lifted flow cover inequalities for mixed 0-1 integer programs , 1999, Math. Program..

[21]  Laurence A. Wolsey,et al.  bc–opt: a branch-and-cut code for mixed integer programs , 1999, Math. Program..

[22]  Andrew J. Miller.  Polyhedral approaches to capacitated lot-sizing problems , 1999 .

[23]  Martin W. P. Savelsbergh,et al.  On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra , 2000, Eur. J. Oper. Res..

[24]  Laurence A. Wolsey,et al.  Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs , 2001, Manag. Sci..

[25]  Laurence A. Wolsey,et al.  Aggregation and Mixed Integer Rounding to Solve MIPs , 2001, Oper. Res..