Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition

Mixed-integer programming models are typically not used to solve realistic-sized production scheduling problems because they require exorbitant solution times. We impose a useful taxonomy on production scheduling problems and develop alternative formulations for a wide variety of problems within the taxonomy. The linear programming relaxation of the new models is very effective in generating bounds. We show that these bounds are equal to those that could be generated using Lagrangian relaxation or column generation. The linear programming bounds increase in effectiveness as the problems become larger. Perhaps of greatest significance is that practitioners can obtain our results using only standard “off-the-shelf” codes such as LINDO or MPSX/370. We report computational experience in several computing environments (hardware and software) on problems with up to 200 products and 10 time periods (2000 0-1 variables).

[1]  Alan S. Manne,et al.  Programming of Economic Lot Sizes , 1958 .

[2]  George B. Dantzig,et al.  Linear programming and extensions , 1965 .

[3]  B. P. Dzielinski,et al.  Optimal Programming of Lot Sizes, Inventory and Labor Allocations , 1965 .

[4]  W. Zangwill.  A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System---A Network Approach , 1969 .

[5]  Arthur F. Veinott,et al.  Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems , 1969, Oper. Res..

[6]  Leon S. Lasdon,et al.  Optimization Theory of Large Systems , 1970 .

[7]  Leon S. Lasdon,et al.  An Efficient Algorithm for Multi-Item Scheduling , 1971, Oper. Res..

[8]  E. Newson.  Multi-Item Lot Size Scheduling by Heuristic Part I: With Fixed Resources , 1975 .

[9]  E. Newson.  Multi-Item Lot Size Scheduling by Heuristic Part II: With Variable Resources , 1975 .

[10]  M. Wagner,et al.  Generalized Linear Programming Solves the Dual , 1976 .

[11]  John A. Muckstadt,et al.  An Application of Lagrangian Relaxation to Scheduling in Power-Generation Systems , 1977, Oper. Res..

[12]  M. Lambrecht,et al.  Heuristic Procedures for the Single Operation, Multi-Item Loading Problem , 1979 .

[13]  Graham K. Rand,et al.  Decision Systems for Inventory Management and Production Planning , 1979 .

[14]  H. Albert Napier,et al.  Optimal Multi-Level Lot Sizing for Requirements Planning Systems , 1980 .

[15]  E. Silver,et al.  A heuristic solution procedure for the multi-item, single-level, limited capacity, lot-sizing problem , 1981 .

[16]  Linus Schrage,et al.  The Multiproduct Lot Scheduling Problem , 1982 .

[17]  Laurence A. Wolsey,et al.  Strong Formulations for Multi-Item Capacitated Lot Sizing , 1984 .

[18]  Anthony J. Zahorik,et al.  Network Programming Models for Production Scheduling in Multi-Stage, Multi-Item Capacitated Systems , 1984 .

[19]  U. Karmarkar,et al.  Computationally Efficient Optimal Solutions to the Lot-Sizing Problem in Multistage Assembly Systems , 1984 .

[20]  Uday S. Karmarkar,et al.  The Deterministic Dynamic Product Cycling Problem , 1985, Oper. Res..

[21]  Gabriel R. Bitran,et al.  Approximation Formulations for the Single-Product Capacitated Lot Size Problem , 1986, Oper. Res..

[22]  Gabriel R. Bitran,et al.  The Multi-Item Capacitated Lot Size Problem: Error Bounds of Manne's Formulations , 1986 .

[23]  Uday S. Karmarkar,et al.  The Dynamic Lot-Sizing Problem with Startup and Reservation Costs , 1987, Oper. Res..

[24]  R. Kipp Martin.  Generating Alternative Mixed-Integer Programming Models Using Variable Redefinition , 1987, Oper. Res..

[25]  Stanley Zionts,et al.  Multi-Item Scheduling by Benders' Decomposition , 1987 .

[26]  Laurence A. Wolsey,et al.  Lot-size models with backlogging: Strong reformulations and cutting planes , 1988, Math. Program..