Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems

We consider a family of N items that are produced in, or obtained from, the same production facility. Demands are deterministic for each item and each period within a given horizon of T periods. If in a given period an order is placed, setup costs are incurred. The aggregate order size is constrained by a capacity limit. The objective is to find a lot-sizing strategy that satisfies the demands for all items over the entire horizon without backlogging, and that minimizes the sum of inventory-carrying costs, fixed-order costs, and variable-order costs. All demands, cost parameters, and capacity limits may be time dependent. In the basic joint setup cost (JS) model, the setup cost of an order does not depend on the composition of the order. The joint and item-dependent setup cost (JIS) model allows for item-dependent setup costs in addition to the joint setup costs. We develop and analyze a class of so-called progressive interval heuristics. A progessive interval heuristic solves a JS or JIS problem over a progressively larger time interval, always starting with period 1, but fixing the setup variables of a progressively larger number of periods at their optimal values in earlier iterations. Different variants in this class of heuristics allow for different degrees of flexibility in adjusting continuous variables determined in earlier iterations of the algorithm. For the JS-model and the two basic implementations of the progressive interval heuristics, we show under some mild parameter conditions that the heuristics can be designed to be e-optimal for any desired value of e > 0 with a running time that is polynomially bounded in the size of the problem. They can also be designed to be simultaneously asymptotically optimal and polynomially bounded. A numerical study covering both the JS and JIS models shows that a progressive interval heuristic generates close-to-optimal solutions with modest computational effort and that it can be effectively used to solve large-scale problems.

[1]  Y. Roll,et al.  A Heuristic Algorithm for the Multi-Item Lot-Sizing Problem with Capacity Constraints , 1982 .

[2]  M. Florian,et al.  DETERMINISTIC PRODUCTION PLANNING WITH CONCAVE COSTS AND CAPACITY CONSTRAINTS. , 1971 .

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

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

[5]  Hartmut Stadtler,et al.  Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows , 2003, Oper. Res..

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

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

[8]  Awi Federgruen,et al.  The Joint Replenishment Problem with Time-Varying Costs and Demands: Efficient, Asymptotic and ε-Optimal Solutions , 1994, Oper. Res..

[9]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[10]  G. D. Eppen,et al.  Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition , 1987, Oper. Res..

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

[12]  Hartmut Stadtler,et al.  The Capacitated Lot-Sizing Problem with Linked Lot Sizes , 2003, Manag. Sci..

[13]  Bezalel Gavish,et al.  A Fully Polynomial Approximation Scheme for Single-Product Scheduling in a Finite Capacity Facility , 1990, Oper. Res..

[14]  Laurence A. Wolsey,et al.  bc -- prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems , 2000 .

[15]  Albert P. M. Wagelmans,et al.  Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems , 2001, Math. Oper. Res..

[16]  S. Graves.  Using Lagrangean Techniques to Solve Hierarchical Production Planning Problems , 1982 .

[17]  A. Federgruen,et al.  A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0n log n or 0n Time , 1991 .

[18]  Michal Tzur,et al.  Algorithms for the multi-item multi-vehicles dynamic lot sizing problem , 2006 .

[19]  K. R. Baker,et al.  An Algorithm for the Dynamic Lot-Size Problem with Time-Varying Production Capacity Constraints , 1978 .

[20]  Chung-Yee Lee,et al.  A new dynamic programming algorithm for the single item capacitated dynamic lot size model , 1994, J. Glob. Optim..

[21]  Michal Tzur,et al.  Algorithms for the Multi-Item Capacitated Dynamic Lot Sizing Problem , 2006 .

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

[23]  Luk N. Van Wassenhove,et al.  Multi Item Single Level Capacitated Dynamic Lotsizing Heuristics: A Computational Comparison (Part II: Rolling Horizon) , 1986 .

[24]  Luk N. Van Wassenhove,et al.  Multi-Item Single-Level Capacitated Dynamic Lot-Sizing Heuristics: A General Review , 1988 .

[25]  Alok Aggarwal,et al.  Improved Algorithms for Economic Lot Size Problems , 1993, Oper. Res..

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

[27]  Steven Nahmias,et al.  Production and operations analysis , 1992 .

[28]  Awi Federgruen,et al.  Time‐partitioning heuristics: Application to one warehouse, multiitem, multiretailer lot‐sizing problems , 1999 .

[29]  Selmer M. Johnson,et al.  Sequential Production Planning Over Time at Minimum Cost , 1957 .

[30]  Awi Federgruen,et al.  Minimal Forecast Horizons and a New Planning Procedure for the General Dynamic Lot Sizing Model: Nervousness Revisited , 1994, Oper. Res..

[31]  J Jaap Wessels,et al.  Multi item lot size determination and scheduling under capacity constraints , 1976 .

[32]  Michal Tzur,et al.  Shipping Multiple Items by Capacitated Vehicles: An Optimal Dynamic Programming Approach , 2005, Transp. Sci..

[33]  Y. Dallery,et al.  Capacitated Lot Sizing models: a literature review , 2008 .

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

[35]  N. Adam,et al.  The Dynamic Lot-Sizing Problem for Multiple Items Under Limited Capacity , 1981 .

[36]  Chien-Hua M. Lin,et al.  An OT2 Algorithm for the NI/G/NI/ND Capacitated Lot Size Problem , 1988 .

[37]  J. K. Lenstra,et al.  Deterministic Production Planning: Algorithms and Complexity , 1980 .

[38]  G. Bitran,et al.  Computational Complexity of the Capacitated Lot Size Problem , 1982 .

[39]  E. J. Anderson,et al.  Deterministic Lotsizing Models for Production Planning , 1991 .

[40]  Dorit S. Hochbaum,et al.  Technical Note - Solving Linear Cost Dynamic Lot-Sizing Problems in O(n log n) Time , 2008, Oper. Res..

[41]  Marc Salomon,et al.  Batching decisions: structure and models , 1994 .

[42]  P. S. Eisenhut.  A Dynamic Lot Sizing Algorithm with Capacity Constraints , 1975 .

[43]  Marc Lambrecht,et al.  A facilities in series capacity constrained dynamic lot-size model , 1978 .

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

[45]  Dong X. Shaw,et al.  An Algorithm for Single-Item Capacitated Economic Lot Sizing with Piecewise Linear Production Costs and General Holding Costs , 1998 .

[46]  Albert P. M. Wagelmans,et al.  Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case , 1992, Oper. Res..

[47]  Awi Federgruen,et al.  A simple forward algorithm to solve general dynamic lot sizing models with n periods in O(n logn) or , 1991 .

[48]  Albert P. M. Wagelmans,et al.  An $O(T^3)$ algorithm for the economic lot-sizing problem with constant capacities , 1993 .