This paper addresses an economic lot scheduling problem (ELSP) for manufacturing environments regarding slack costs and deteriorating items using the extended basic period approach under Power-of-Two (PoT) policy. The purpose of this research is to determine an optimal batch size for a product and minimizing total related costs to such a problem. The cost function consists of three components, namely, setup cost, holding cost includes deteriorating factor, and slack cost. The ELSP is concerned with the scheduling decision of n items and lot sizing. Avoiding schedule interference is the main problem in ELSP. The used PoT policy ensures that the replenishment cycle of each item to be integer and this task reduces potential schedule interferences. Since the ELSP is shown as an NP-hard problem, an imperialist competitive algorithm is employed to provide good solutions within reasonable computational times. Computational results show that the proposed approach can efficiently solve such complicated problems.
Economic lot scheduling problem Deterioration factor Shortage cost Imperialist competitive algorithm
This is a preview of subscription content, log in to check access.
Abad PL (1996) Optimal pricing and lot-sizing under conditions of perish ability and partial backordering. Manag Sci 42:1093–1104zbMATHCrossRefGoogle Scholar
Abad PL (2000) Optimal lot size for a perishable good under conditions of finite production and partial backordering and lost sale. Comput Ind Eng 38:457–465CrossRefGoogle Scholar
Al-Aomar R (2006) Incorporating robustness into genetic algorithm search of stochastic simulation outputs. Simulat Model Pract Theor 14:201–223CrossRefGoogle Scholar
Atashpaz E, Lucas C (2007) Imperialist Competitive Algorithm: An Algorithm for Optimization Inspired by Imperialist Competition. 2007 IEEE Congress on Evolutionary Computation (CEC 2007).Google Scholar
Balkhi Z, Benkherouf L (1996) A production lot size inventory model for deteriorating items and arbitrary production and demand rates. Eur J Oper Res 92:302–309zbMATHCrossRefGoogle Scholar
Boesel J, Nelson BL, Ishii N (2003) A framework for simulation-optimization software. IIE Transactions 35:221–229CrossRefGoogle Scholar
Cooke DL, Rohleder TR, Silver ED (2004) Finding effective schedules for the economic lot scheduling problem: a simple mixed integer programming approach. Int J Prod Res 42:21–36zbMATHCrossRefGoogle Scholar
Phadke MS (1989) Quality engineering using robust design. Prentice-Hall, Engelwood CliffsGoogle Scholar
Pohlheim H (2001) Evolutionary algorithms: principles, methods, and algorithms [online]. Available from: http://www.geatbx.com/index.html, [accessed on 6 May 2004].
Raafat F (1991) Survey of literature on continuously deteriorating inventory models. J Oper Res Soc 42:27–37zbMATHGoogle Scholar
Roundy R (1984) Rounding off to powers of two in continuous relaxations of capacitated lot sizing problems. Manag Sci 35:1433–1442MathSciNetCrossRefGoogle Scholar
Soman CA, Van Donk DP, Gaalman G (2003) Combined make-to-order and make-to-stock in a food production system. To appear in International Journal of Production Economics, http://dx.doi.org/10.1016/S0925-5273(02)00376-6.
Soman CA, Van Donk DP, Gaalman G (2004) A basic period approach to the economic lot scheduling problem with shelf life considerations. Int J Prod Res 42:1677–1689zbMATHCrossRefGoogle Scholar
Taguchi G (1986) Introduction to quality engineering. Asian Productivity, White PlainsGoogle Scholar
Tsai JT, Ho WH, Liu TK, Chou JH (2007) Improved immune algorithm for global numerical optimisation and job-shop scheduling problems. Appl Math Comput 194:406–424MathSciNetzbMATHCrossRefGoogle Scholar