Abstract
This paper addresses simultaneous capacitated lot sizing and storage allocation in a multi-item manufacturing environment. The Capacitated Lot Sizing Problem (CLSP) is a very crucial tactical level decision making problem resulting in production amounts and replenishment cycles in a dynamic demand environment. Regarding the capacity aspect, there may be different kinds of sources. Capacity bounds may be set on production capacity, and there may also be another upper bound on the units-on-hand inventory due to limited warehouse capacity which is a direct outcome of an adapted storage allocation policy in warehouse activities. Solving such an extended CLSP is proved to suffer from NP-hardness properties. Hence, heuristic algorithms are required to simultaneously solve lot sizing and pre-defined storage allocation problems. The aim of the study is to present a two-stage metaheuristic algorithm to solve related problems in polynomial time under different storage allocation policy boundaries on inventory. The proposed algorithm utilizes transfer of lots between consecutive periods. Results show that storage allocation policies which are primary drivers of inventory boundaries directly affect the results obtained. The algorithm is also applied to a shop floor planning problem.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Baker, K.R.: Introduction to Sequencing and Scheduling. Wiley, New York (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)
Dixon, P.S., Phol, C.L.: Heuristic procedures for multi-item inventory planning with limited storage. IIE Transactions 22(2), 112–123 (1990)
Grahl, J., Radtke, A., Minner, S.: Fitness landscape analysis of dynamic multi-product lot-sizing problems with limited storage. In: Gunther, H.O., Mattfeld, D.C., Suhl, L. (eds.) Management Logistischer Netzwerke, pp. 257–277. Physica, Heidelberg (2007)
Gutierrez, J., Sedeno-Noda, A., Colebrook, M., Sicilia, J.: An efficient approach for solving the lot-sizing problem with time-varying storage capacities. European Journal of Operational Research 189(3), 682–693 (2008)
Günther, H.-O.: A heuristic solution procedure for lot sizing under production and storage capacity constraints. In: Ahn, B.-H. (ed.) Asian-Pacific Operations Research: APORS 1988, pp. 349–362. Elsevier, Amsterdam (1990)
Hwang, H.C., van den Heuvel, W.: Improved algorithms for a lot-sizing problem with inventory bounds and backlogging. Naval Research Logistics 59(3-4), 244–253 (2012)
Iris, C., Yenisey, M.M.: An Efficient Heuristic Algorithm for Capacitated Lot Sizing Problem with Overtime Decisions. In: Frick, J., Laugen, B. (eds.) APMS 2011. IFIP AICT, vol. 384, pp. 107–114. Springer, Heidelberg (2012)
Lee, M.K., Elsayed, E.A.: Optimization of warehouse storage capacity under a dedicated storage policy. International Journal of Production Research 43(9), 1785–1805 (2005)
Liu, X.: A polynomial time algorithm for production planning with bounded inventory. International Journal of Advanced Manufacturing Technology 39(7-8), 774–782 (2008)
Minner, S.: A comparison of simple heuristics for multi-product dynamic demand lot-sizing with limited warehouse capacity. International Journal of Production Economics 118(1), 305–310 (2008)
Mishra, N., Kumar, V., Kumar, N., Kumar, M., Timari, M.K.: Addressing lot sizing and warehousing scheduling problem in manufacturing environment. Expert Systems with Applications 38(9), 11751–11762 (2011)
Muppani, V.R., Adil, G.K.: A branch and bound algorithm for class based storage location assignment. European Journal of Operational Research 189(2), 492–507 (2008)
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)
Tempelmeier, H., Derstroff, M.: A Lagrangean-based heuristic for dynamic multi-level multi-item constrained lot sizing with setup times. Management Science 42(5), 738–757 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Iris, C., Yenisey, M.M. (2012). Multi-item Simultaneous Lot Sizing and Storage Allocation with Production and Warehouse Capacities. In: Hu, H., Shi, X., Stahlbock, R., Voß, S. (eds) Computational Logistics. ICCL 2012. Lecture Notes in Computer Science, vol 7555. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33587-7_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-33587-7_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33586-0
Online ISBN: 978-3-642-33587-7
eBook Packages: Computer ScienceComputer Science (R0)