A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing

In this paper, we develop a Lagrangean relaxation-based heuristic procedure to generate near-optimal solutions to very-large-scale capacitated lot-sizing problems (CLSP) with setup times and limited overtime. Our computational results show that large problems involving several thousand products and several thousand 0/1 integer variables can be solved in a reasonable amount of computer time to within one percent of their optimal solution. The proposed procedure is general enough to be applied directly or with slight modification to real-life production problems.

• 저널Management Science · 38(9) · 1329–1340
• 토픽Supply Chain and Inventory Management · Management Information Systems
• DOI10.1287/mnsc.38.9.1329
• 저자Moustapha Diaby, Harish C. Bahl, Mark H. Karwan, Stanley Zionts