Abstract
Capacitated Lot Sizing Problem is a very important tactical level decision making problem that answers the questions of producing when and how many in dynamic demand environment. Solving Capacitated Lot Sizing Problem with Overtime decisions (CLSPO) and extensions derived from the fundamental structure optimally suffer from combinatorial nature of the problem. The aim of the study is to form a two-stage heuristic algorithm to solve related problem in polynomial time. In first part, characteristics of problem structure are presented. Dominance properties are presented to help algorithm obtain a bounded search area. Proposed algorithm directly utilizes such shortcoming. Performance of approach is tested by using different criteria. And finally, robustness test are applied to check how well algorithm performs against fluctuations in its data. Simulated annealing as improvement heuristic performs well for related problem. It is also observed that fluctuations of data directly affects performance outcome. Obtained results also reveal that performance of improvement heuristic highly depends on constructive heuristic. Algorithm is also applied to an industry case study to plan master production schedule with minimum costs.
Chapter PDF
Similar content being viewed by others
References
Tempelmeier, H., Derstroff, M.: A Lagrangean-based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times. Management Science 42(5), 738–757 (1996)
Ozdamar, L., Barbarosoglu, G.: An integrated Lagrangean relaxation-simulated annealing approach to the multi-level multi-item capacitated lot sizing problem. International Journal of Production Economics 68(3), 319–331 (2000)
Ozdamar, L., Bozyel, M.A.: The capacitated lot sizing problem with overtime decisions and setup times. IIE Transactions 32(11), 1043–1057 (2000)
Bahl, H.C., Ritzman, L.P., Gupta, J.N.D.: Determining lot sizes and resource requirements: A review. Operations Research 35(3), 329–345 (1987)
Jans, R., Degraeve, Z.: Modelling Industrial Lot Sizing Problems: a Review. International Journal of Production Research 46(6), 1619–1643 (2008)
Baker, K.R.: Introduction to Sequencing and Scheduling. John Wiley and Sons, USA (1974)
Barbarosoglu, G., Ozdamar, L.: Analysis of solution space-dependent performance of simulated annealing: the case of the multi-level capacitated lot sizing problem. Computers & Operations Research 27(9), 895–903 (2000)
Tang, O.: Simulated annealing in lot sizing problems. International Journal of Production Economics 88(2), 173–181 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 IFIP International Federation for Information Processing
About this paper
Cite this paper
Iris, C., Yenisey, M.M. (2012). An Efficient Heuristic Algorithm for Capacitated Lot Sizing Problem with Overtime Decisions. In: Frick, J., Laugen, B.T. (eds) Advances in Production Management Systems. Value Networks: Innovation, Technologies, and Management. APMS 2011. IFIP Advances in Information and Communication Technology, vol 384. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33980-6_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-33980-6_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33979-0
Online ISBN: 978-3-642-33980-6
eBook Packages: Computer ScienceComputer Science (R0)