Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times

In this paper, we solve the capacitated multi item lot-sizing problem with non-customer specific production time windows and setup times using two approaches: (i) using a Lagrangian relaxation-based heuristic and (ii) using reformulations and a commercial software. The results of the two approaches are analyzed and compared based on randomly generated data sets. The results show that the first approach finds feasible solution more rapidly but a steady state is reached very quickly. On the other hand the second approach quickly finds good lower bounds and finds good feasible solutions if more CPU time is allowed. It turns out that, for a wide variety of instances varying in size and other parameters, we can obtain feasible solutions within 1-5% of optimal within 10s and also obtain solutions that are guaranteed within 1-2% of optimal within 60-120s.

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

[2]  Zeger Degraeve,et al.  Improved lower bounds for the capacitated lot sizing problem with setup times , 2004, Oper. Res. Lett..

[3]  Luk N. Van Wassenhove,et al.  Lagrangean relaxation based heuristics for lot sizing with setup times , 2009, Eur. J. Oper. Res..

[4]  Ke Ding,et al.  A Tabu-Search Heuristic for the Capacitated Lot-Sizing Problem with Set-up Carryover , 2001, Manag. Sci..

[5]  Laurence A. Wolsey,et al.  Lot-sizing with production and delivery time windows , 2005, Math. Program..

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

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

[8]  Zeger Degraeve,et al.  BIBLIOGRAPHIC DATA AND CLASSIFICATIONS , 2003 .

[9]  Hark-Chin Hwang.  Dynamic lot-sizing model with production time windows , 2007 .

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

[11]  Mathieu Van Vyve,et al.  A solution approach of production planning problems based on compact formulations for single-item lot-sizing models , 2004, 4OR.

[12]  Albert P. M. Wagelmans,et al.  Four equivalent lot-sizing models , 2008, Oper. Res. Lett..

[13]  Alper Atamtürk,et al.  Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation , 2005, Oper. Res..

[14]  Luk N. Van Wassenhove,et al.  A simple heuristic for the multi item single level capacitated lotsizing problem , 1986 .

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

[16]  Stéphane Dauzère-Pérès,et al.  Capacitated Multi-Item Lot-Sizing Problems with Time Windows , 2006, Oper. Res..

[17]  Marco Caserta,et al.  A cross entropy-Lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times , 2009, Comput. Oper. Res..

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

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

[20]  Laurence A. Wolsey,et al.  Approximate extended formulations , 2006, Math. Program..

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

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