Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bitran GR and Yanasse HH (1982). Computational complexity of the capacitated lot size problem. Mngt Sci 28: 1174–1186.
Florian M, Lenstra JK and Rinnooy Kan AHG (1980). Deterministic production planning: algorithms and complexity. Mngt Sci 26: 669–679.
Trigeiro W, Thomas J and McClain J (1989). Capacitated lot sizing with setup times. Mngt Sci, 35: 353–366.
Miller AJ, Nemhauser GL and Savelsbergh WP (2000). On the capacitated lot-sizing and continuous 0–1 knapsack polyhedra. Eur J Opl Res 125: 298–315.
Beasley JE (1993). Lagrangean relaxation. In: Reaves C (ed). Modern Heuristic Techniques in Combinatorial Problems. Blackwell Scientific Publications: London, pp 243–303.
Diaby M, Bahl HC, Karwan MH and Zionts S (1992). A Lagrangean relaxation approach for very-large-scale capacitated lot-sizing. Mngt Sci 38: 1329–1340.
Diaby M, Bahl HC, Karwan MH, Zionts S (1992). Capacitated lot-sizing and scheduling by Lagrangean relaxation. Eur J Opl Res 59: 444–458.
Bowman EH (1956). Production scheduling by the transportation method of linear programming. Opns Res 14: 100–103.
Wagner MH and Whitin TM (1958). Dynamic version of the economic lot-sizing model. Mngt Sci 5: 89–96.
Hindi KS (1995) Computationally efficient solution of the multi-item, capacitated lot-sizing problem. Comput Ind Eng 28: 709–719.
Ali A, Padman R and Thiagarajan H (1989). Dual algorithms for pure network problems. Opns Res 37: 158–171.
Hindi KS (1993). Efficient Implementation of Network Simplex Algorithms. DTG Report 93:3 (update of DTG report 87:7), Department of Computation, University of Manchester Institute of Science and Technology (UMIST).
Grigoriadis MD (1986). An efficient implementation of the network simplex method. Math Prog Study 26: 83–111.
Hindi KS (1995). Algorithms for capacitated, multi-item lot-sizing without setups. J Opl Res Soc 46: 465–472.
Mladenović N and Hansen P (1997). Variable neighbourhood search. Computs Opns Res, 24: 1097–1100.
Hansen P and Mladenović N (1999). An introduction to variable neighbourhood search. In: Voß S et al (eds). Metaheuristics, Advances and Trends in Local Search Paradigms for Optimization. Kluwer: Dordrecht, pp 433–458.
Acknowledgements
The authors are grateful to Dr W Trigeiro and to Dr M Diaby, each for supplying the source code of his algorithm. They are also grateful to Dr Trigeiro for supplying the data set used for testing.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Hindi, K., Fleszar, K. & Charalambous, C. An effective heuristic for the CLSP with set-up times. J Oper Res Soc 54, 490–498 (2003). https://doi.org/10.1057/palgrave.jors.2601525
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1057/palgrave.jors.2601525