Two-stage stochastic capacitated Lot-Sizing problem by Lot-Size adaptation approach

Document Type : Original Article

Authors

1 Department of Mathematics, University of Kurdistan, Sanandaj, Iran

2 Department of Mathematics, Campus of Bijar, University of Kurdistan, Sanandaj, Iran

3 Department of Mathematics, Faculty of Basic Sciences, Ilam University, P.O. Box 69315-516, Ilam, Iran

Abstract

In this paper, a two-stage stochastic capacitated lot-sizing problem with random demand, and service level constraints  under static and static-dynamic uncertainty strategies is introduced. A static strategy determines the setup period and lot sizing at the beginning of planning period, whereas a static-dynamic strategy allows the lot size to be adjusted during  the planning period. A new model formulation of the demand differential adjustment policy in a multi-stage production system is proposed. Lot-sizing adjustments depend on the difference in demand between actual and expected demand. To quantify the economics of our uncertainty strategy for multi-level lot size the problems, the number of test instances with different parameter settings is evaluated. Computational experiments show that the additional costs of semifinished products, and the lack of storage capacity in the downstream processes reduce the potential for cost savings via multi-volume reform. Also a robust model is developed and as the robust model under study is NP-hard, it solved by a hybrid heuristic using the proposed stochastic model, a robust model is developed, which is solved by a hybrid heuristic  algorithm based on Lagrangian relaxation and Bender’s decomposition algorithms. To evaluate the convergence rate and solution quality, the method is applied to some random test instances generated in the literature. The computational results indicate that the proposed method is capable of efficiently solving the model.

Keywords

Main Subjects

References

1] J. F. Benders, Partitioning procedures for solving mixed-variables programming problems, Numerische Mathematik, 4 (1962), pp. 238–252.
[2] J. H. Bookbinder and J. Y. Tan, Strategies for the probabilistic lot-sizing problem with service-level constraints, Management Science, 34 (1988), pp. 1096–1108.
[3] P. Brandimarte, Multi-item capacitated lot-sizing with demand uncertainty, International Journal of Production Research, 44 (2006), pp. 2997–3022.
[4] M. Gansterer, P. Fodermayr, and R. F. Hartl ¨ , The capacitated multi-level lot-sizing problem with distributed agents, International Journal of Production Economics, 235 (2021), p. 108090.
[5] S. Helber, F. Sahling, and K. Schimmelpfeng, Dynamic capacitated lot sizing with random demand and dynamic safety stocks, OR Spectrum, 35 (2013), pp. 75–105.
[6] Z. Hu and G. Hu, A two-stage stochastic programming model for lot-sizing and scheduling under uncertainty, International Journal of Production Economics, 180 (2016), pp. 198–207.
[7] , A multi-stage stochastic programming for lot-sizing and scheduling under demand uncertainty, Computers &  Industrial Engineering, 119 (2018), pp. 157–166.
[8] B. Karimi, S. M. F. Ghomi, and J. M. Wilson, The capacitated lot sizing problem: A review of models and algorithms, Omega, 31 (2003), pp. 365–378.
[9] E. Koca, H. Yaman, and M. S. Akturk ¨ , Stochastic lot sizing problem with nervousness considerations, Computers & Operations Research, 94 (2018), pp. 23–37.
[10] S. C. Leung, S. O. Tsang, W. Ng, and Y. Wu, A robust optimization model for multi-site production planning problem in an uncertain environment, European Journal of Operational Research, 181 (2007), pp. 224– 238.
[11] M. Mickein and K. Haase, The lot-size adaptation approach for the two-level stochastic capacitated lotsizing problem, in International Conference on Operations Research, Springer International Publishing, 2022, pp. 661–667.
[12] F. Quezada, C. Gicquel, S. Kedad-Sidhoum, and D. Q. Vu, A multi-stage stochastic integer programming approach for a multi-echelon lot-sizing problem with returns and lost sales, Computers & Operations Research, 116 (2020), p. 104865.
[13] G. Ramaraj, Z. Hu, and G. Hu, A two-stage stochastic programming model for production lot-sizing and scheduling under demand and raw material quality uncertainties, International Journal of Planning and Scheduling, 3 (2019), pp. 1–27.
[14] A. C. Randa, M. K. Dogru, C. Iyigun, and U. ˘ Ozen ¨ , Heuristic methods for the capacitated stochastic lotsizing  problem under the static-dynamic uncertainty strategy, Computers & Operations Research, 109 (2019), pp. 89–101.
[15] C. U. S¸afak, G. Yılmaz, and E. Albey, A hierarchical approach for solving simultaneous lot sizing and scheduling problem with secondary resources, IFAC-PapersOnLine, 52 (2019), pp. 1931–1936.
[16] H. Tempelmeier and T. Hilger, Linear programming models for a stochastic dynamic capacitated lot sizing problem, Computers & Operations Research, 59 (2015), pp. 119–125.
[17] S. Thevenin, Y. Adulyasak, and J. F. Cordeau, Material requirements planning under demand uncertainty using stochastic optimization, Production and Operations Management, 30 (2021), pp. 475–493.
[18] H. Tunc, O. A. Kilic, S. A. Tarim, and R. Rossi, An extended mixed-integer programming formulation and dynamic cut generation approach for the stochastic lot-sizing problem, INFORMS Journal on Computing, 30 (2018), pp. 492–506.
[19] C. S. Yu and H. L. Li, A robust optimization model for stochastic logistic problems, International Journal of Production Economics, 64 (2000), pp. 385–397.
[20] M. K. Zanjani, M. Nourelfath, and D. Ait-Kadi, A scenario decomposition approach for stochastic production planning in sawmills, Journal of the Operational Research Society, 64 (2013), pp. 48–59.
AUT Journal of Mathematics and Computing
Volume 6, Issue 1
January 2025
Pages 55-66

Files

Share

How to cite

Statistics