A Multi-objective Multi-item Capacitated Lot-sizing Model with Safety Stock and Shortage Costs based on Just-in-time Approach
DOI:
https://doi.org/10.55677/GJEFR/01-2025-Vol02E4Keywords:
Production Planning, Just-in-time, Lot-sizing, Multi-objective Optimization, Simulated annealing.Abstract
Lot-sizing problem is a class of production planning problems in which the availability amounts of the production plan are always considered as decision variable. Goal of this paper is to propose a new multi-item capacitated lot-sizing problem (MICLSP) with setup times, safety stock deficit costs, demand shortage costs both backorder and lost sale states, and different production manners. Although a considerable amount of researches concentrates on model development and solution procedures in the terms of single-objective problems in the past decade, to make the model more realistic, this paper develops a multi-objective mathematical programming model with three conflicting objectives. First objective attempts to minimize the total cost considered by the production plans including production costs with different production manners, inventory costs, safety stock deficit costs, shortage costs, and setup costs. Second objective is for leveling the production volume in different production periods. Third objective follow to force the model to produce as near as possible to just-in-time (JIT). The proposed model was indicated to be strongly NP-hard; hence a random search algorithm namely multi-objective simulated annealing (MOSA) has been proposed based on Lp-metric technique. At the end, results analysis on different sizes of problems demonstrates the intelligence and efficiency of the proposed methodology.
References
1. Absi, N., & Kedad-Sidhoum, S. (2007). MIP-based heuristics for multi item capacitated lot-sizing problem with setup times and shortage costs. RAIRO–Operations Research, 41, 2, 171–192.
2. Absi N., Kedad-Sidhoum S., “The multi-item capacitated lot-sizing problem with setup times and shortage costs”, European Journal of Operational Research, 185, 1351-1374, 2008.
3. Absi N., Kedad-Sidhoum S., “The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs”, Computer and Operations Research, 36, 2926–2936, 2009.
4. Absi A., Detienne B., Dauzere-Peres S., “Heuristics for the multi-item capacitated lot-sizing problem with lost sales”, Computers & Operations Research, 40, 264–272, 2013.
5. Aksen D., Altinkemer K., Chand S., “The single-item lot-sizing problem with immediate lost sales”, European Journal of Operational Research, 147, 558–566, 2003.
6. Berretta R., Rodrigues L.F., “A memetic algorithm for a multistage capacitated Lot-sizing problem”, International Journal of Production Economics, 87, 67-81, 2004.
7. Chen WH., Thizy JM., “Analysis of relaxations for the multi-item capacitated lot-sizing problem”, Annals of Operations Research, 26, 29–72, 1990.
8. Coello CA, Lamont GB, Van Veldhuizen DA. “Evolutionary algorithms for solving multiobjective problems”, 2nd ed., Springer, Berlin 2007.
9. Ehrgott, M. and Gandibleux X. (2003), Multiple Criteria Optimization: State of the art annotated bibliographic survey, New York, Boston, Dordrecht, London, Moscow.
10. Han Y., Tang J., Kaku I., Mu L., “Solving uncapacitated multilevel lot-sizing problems using a particle swarm optimization with flexible inertial weight”, Computers & Mathematics with Applications, 57, 1748-1755, 2009.
11. Karimi-Nasab M., Aryanezhad M.B., “A multi-objective production smoothing model with compressible operating times”, Applied Mathematical Modelling, 35, 3596–3610, 2011.
12. Karimi B., Fatemi Ghomi S.M.T., Wilsonb J.M., “The capacitated lot sizing problem: a review of models and algorithms”, Omega, 31, 365 – 378, 2003.
13. Karimi-Nasab M., Konstantaras L., “A random search heuristic for a multi-objective production planning”, Computers & Industrial Engineering, 62, 479–490, 2012.
14. Kazan O., Nagi R., Rump, C.M., “New lot-sizing formulations for less nervous production Schedules”, Computers & Operations Research, 27, 1325-1345, 2000.
15. Kirkpatrick, S, Gelatt, C.D., Vecchi, M.P. 1983. optimization by Simulated Annealing. Science, vol 220, No. 4598, pp 671-680.
16. Loparic M., Pochet Y., Wolsey LA., “The uncapacitated lot-sizing problem with sales and safety stocks”, Mathematical Programming, 89, 487–504, 2001.
17. Manne A.S., “Programming of economic lot-sizes”, Management Science, 4, 115–135, 1958.
18. MATLAB Version 7.10.0.499 (R2010a). The MathWorks, Inc. Protected by U.S. and international patents, 2010.
19. Pasandideh SHR, Niaki STA, Hajipour V. “A multi-objective facility location model with batch arrivals: two parameter-tuned meta-heuristic algorithms”, Journal of Intelligent Manufacturing, 24, 331-348, 2013.
20. Radcliffe, N. J. (1991). Forma analysis and random respectful recombination. In Proceedings of the fourth international conference on genetic algorithms (pp. 222–229). Morgan Kaufmann, San Mateo, CA.
21. Rezaei J., Davoodi M., “Multi-objective models for lot-sizing with supplier selection”, International Journal of Production Economics, 130, 77-86, 2011.
22. Sural H., Denize lM., VanWassenhove LN., “Lagrangean relaxation based heuristics for lot-sizing with setup times”, European Journal of Operational Research, 194, 1, 51–60, 2009.
23. Tang O., “Simulated annealing in lot sizing problems”, Int. J. Production Economics, 88, 173–181, 2004.
24. Tavakkoli-Moghaddam A., Rahimi-Vahed A.R., Ghodratnama A., Siadat A., “A simulated annealing method for solving a new mathematical model of a multi-criteria cell formation problem with capital constraints”, Advances in Engineering Software, 40, 268-273, 2009.
25. Tempelmeier H., Derstroff M., “A Lagrangean-Based Heuristic for Dynamic Multilevel Multi item Constrained Lot sizing with Setup Times”, Management Science, 42, 738-757, 1996.
26. Wagner H. M., Whitin T.M., “A dynamic version of the economic lit size model”, Management Science, 5, 89-96, 1958.
27. Xiao Y., Kaku I., Zhao Q., Zhang R., “A variable neighborhood search based approach for uncapacitated multilevel lot-sizing problems”, Computers & Industrial Engineering, 60, 218, 2011.
28. Yeniay O, Ankare B. “Penalty function methods for constrained optimization with genetic algorithms”, Mathematical and Computational Application; 10: 45-56, 2005.
Downloads
Published
Issue
Section
License
Copyright (c) 2025 Global Journal of Economic and Finance Research

This work is licensed under a Creative Commons Attribution 4.0 International License.