An effective heuristic for the CLSP with set-up times

The problem of multi-item, single level, capacitated, dynamic lot-sizing with set-up times (CLSP with set-up times) is considered. The difficulty of the problem compared with its counterpart without set-up times is explained. A lower bound on the value of the objective function is calculated by Lagrangian relaxation with subgradient optimisation. During the process, attempts are made to get good feasible solutions (ie. upper bounds) through a smoothing heuristic, followed by a local search with a variable neighbourhood. Solutions found in this way are further optimised by solving a capacitated transshipment problem. The paper describes the various elements of the solution procedure and presents the results of extensive numerical experimentation.

[1]  M. Guignard Lagrangean relaxation , 2003 .

[2]  Pierre Hansen,et al.  Variable Neighbourhood Search , 2003 .

[3]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[4]  Martin W. P. Savelsbergh,et al.  On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra , 2000, Eur. J. Oper. Res..

[5]  A. Novaes,et al.  A Queuing Model for Unitized Cargo Generation , 1966, Oper. Res..

[6]  Nenad Mladenović,et al.  An Introduction to Variable Neighborhood Search , 1997 .

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

[8]  Michael Florian,et al.  AN EFFICIENT IMPLEMENTATION OF THE NETWORK SIMPLEX METHOD. , 1997 .

[9]  K. Hindi Computationally efficient solution of the multi-item, capacitated lot-sizing problem , 1995 .

[10]  Harish C. Bahl,et al.  Capacitated lot-sizing and scheduling by Lagrangean relaxation , 1992 .

[11]  P. V. Oorschot,et al.  Efficient Implementation , 2022 .

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

[13]  E. H. Bowman Production Scheduling by the Transportation Method of Linear Programming , 1956 .

[14]  Khalil S. Hindi,et al.  Algorithms for Capacitated, Multi-Item Lot-Sizing without Set-Ups , 1995 .

[15]  Harish C. Bahl,et al.  A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing , 1992 .

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

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

[18]  Rema Padman,et al.  Dual Algorithms for Pure Network Problems , 1989, Oper. Res..

[19]  Silvano Martello,et al.  Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization , 2012 .