Capacitated Multi-Item Lot-Sizing Problems with Time Windows

This research concerns a new family of capacitated multi-item lot-sizing problems, namely, lot-sizing problems with time windows. Two classes of the problem are analyzed and solved using different Lagrangian heuristics. Capacity constraints and a subset of time window constraints are relaxed resulting in particular single-item time window problems that are solved in polynomial time. Other relaxations leading to the classical Wagner-Whitin problem are also tested. Several smoothing heuristics are implemented and tested, and their results are compared. The gaps between lower and upper bounds for most problems are very small (less than 1%). Moreover, the proposed algorithms are robust and do not seem to be too affected when different parameters of the problem are varied.

[1]  H. Sherali,et al.  On the choice of step size in subgradient optimization , 1981 .

[2]  J. Krarup,et al.  Plant location, Set Covering and Economic Lot Size: An 0 (mn)-Algorithm for Structured Problems , 1977 .

[3]  Richard M. Karp,et al.  The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..

[4]  Claude Lemaréchal,et al.  Lagrangian Relaxation , 2000, Computational Combinatorial Optimization.

[5]  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 .

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

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

[8]  Luk N. Van Wassenhove,et al.  Multi Item Single Level Capacitated Dynamic Lotsizing Heuristics: A Computational Comparison (Part I: Static Case) , 1986 .

[9]  Marshall L. Fisher,et al.  The Lagrangian Relaxation Method for Solving Integer Programming Problems , 2004, Manag. Sci..

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

[11]  John M. Wilson,et al.  The capacitated lot sizing problem: a review of models and algorithms , 2003 .

[12]  S. Dauzere-Peres,et al.  A review of single item lot sizing problems , 2002, IEEE International Conference on Systems, Man and Cybernetics.

[13]  Marc Salomon,et al.  The Single-Item Discrete Lotsizing and Scheduling Problem: Optimization by Linear and Dynamic Programming , 1994, Discret. Appl. Math..

[14]  Chung-Yee Lee,et al.  A Dynamic Lot-Sizing Model with Demand Time Windows , 2001 .

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

[16]  Wun-Hwa Chen,et al.  Analysis of relaxations for the multi-item capacitated lot-sizing problem , 1991 .

[17]  Harvey M. Wagner,et al.  Dynamic Version of the Economic Lot Size Model , 2004, Manag. Sci..

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

[19]  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..

[20]  Harvey H. Millar,et al.  Lagrangian heuristics for the capacitated multi-item lot-sizing problem with backordering , 1994 .

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

[22]  Marc Salomon,et al.  Statistical search methods for lotsizing problems , 1993, Ann. Oper. Res..