Advertisement

The economic lot scheduling problem with deteriorating items and shortage: an imperialist competitive algorithm

  • V. Kayvanfar
  • M. ZandiehEmail author
ORIGINAL ARTICLE

Abstract

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.

Keywords

Economic lot scheduling problem Deterioration factor Shortage cost Imperialist competitive algorithm 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abad PL (1996) Optimal pricing and lot-sizing under conditions of perish ability and partial backordering. Manag Sci 42:1093–1104zbMATHCrossRefGoogle Scholar
  2. 2.
    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
  3. 3.
    Al-Aomar R (2006) Incorporating robustness into genetic algorithm search of stochastic simulation outputs. Simulat Model Pract Theor 14:201–223CrossRefGoogle Scholar
  4. 4.
    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
  5. 5.
    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
  6. 6.
    Boesel J, Nelson BL, Ishii N (2003) A framework for simulation-optimization software. IIE Transactions 35:221–229CrossRefGoogle Scholar
  7. 7.
    Bomberger E (1966) A dynamic programming approach to a lot scheduling problem. Manag Sci 12:778–84zbMATHCrossRefGoogle Scholar
  8. 8.
    Brander P, Segerstedt A (2009) Economic lot scheduling problems incorporating a cost of using the production facility. Int J Prod Res 47:3611–3624zbMATHCrossRefGoogle Scholar
  9. 9.
    Chatfield DC (2007) The economic lot scheduling problem: a pure genetic search approach. Comput Oper Res 34:2865–2881zbMATHCrossRefGoogle Scholar
  10. 10.
    Cochran WG, Cox GM (1992) Experimental designs, 2nd edn. Wiley, New YorkzbMATHGoogle Scholar
  11. 11.
    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
  12. 12.
    Dobson G (1987) The ELSP: achieving feasibility using time-varying lot sizes. Oper Res 35(5):764–71MathSciNetzbMATHCrossRefGoogle Scholar
  13. 13.
    Eilon S (1958) Economic batch size determination for multiproduct scheduling. Oper Res Q 10:217–277CrossRefGoogle Scholar
  14. 14.
    Elmaghraby SE (1978) The economic lot scheduling problem (ELSP): review and extension. Manag Sci 24:587–597zbMATHCrossRefGoogle Scholar
  15. 15.
    Elsayed EA, Teresi C (1983) Analysis of inventory system with deteriorating items. Int J Prod Res 21:449–460zbMATHCrossRefGoogle Scholar
  16. 16.
    Federgruen A, Zheng YS (1993) Optimal power-of-two replenishment strategies in capacitated general production distribution networks. Manag Sci 39:710–727zbMATHCrossRefGoogle Scholar
  17. 17.
    Gallego G, Joneja D (1994) Economic lot scheduling problem with raw material considerations. Oper Res 42(1):92–101zbMATHCrossRefGoogle Scholar
  18. 18.
    Ghare PM, Schrader GF (1963) A model for an exponentially decaying inventory. J Ind Eng 14:238–243Google Scholar
  19. 19.
    Goyal SK (1975) Scheduling a multi-product single machine system—a new approach. Int J Prod Res 13:487–93CrossRefGoogle Scholar
  20. 20.
    Heng KJ, Labban J, Linn RJ (1991) An order-level lot-size inventory model for deteriorating items with finite replenishment rate. Comput Ind Eng 20:187–197CrossRefGoogle Scholar
  21. 21.
    Heydari M, Torabi SA (2008) The economic lot scheduling problem in flow lines with sequence-dependent setups. World Academy of Science Eng Tech 47:2008Google Scholar
  22. 22.
    Hsu WL (1983) On the general feasibility of scheduling lot sizes of several products on one machine. Manag Sci 29:93–105zbMATHCrossRefGoogle Scholar
  23. 23.
    Hunter A (1998) Crossing over genetic algorithms: the Sugal generalized GA. Journal of Heuristics 4:179–192zbMATHCrossRefGoogle Scholar
  24. 24.
    Jackson PL, Maxwell WL, Muckstadt JA (1985) The joint replenishment problem with a power-of-two restriction. IIE Trans 17:25–32CrossRefGoogle Scholar
  25. 25.
    Khabbazi A, Atashpaz E, Lucas C (2009) Imperialist competitive algorithm for minimum bit error rate beamforming. Int J Bio-Inspired Comput 1:125–133CrossRefGoogle Scholar
  26. 26.
    Lopez MA, Kingsman BG (1991) The economic lot scheduling problem: theory and practice. Int J Prod Econ 23:147–164CrossRefGoogle Scholar
  27. 27.
    Luss H, Rosenwein MB (1990) A lot-sizing model for just-in-time manufacturing. J Oper Res Soc 41(3):201–209zbMATHGoogle Scholar
  28. 28.
    Maxwell WL (1964) The scheduling of economic lot sizes. Nav Res Logist Q 11:89–124MathSciNetCrossRefGoogle Scholar
  29. 29.
    Misra RB (1975) Optimal production lot size model for a system with deteriorating items. Int J Prod Res 13:495–505CrossRefGoogle Scholar
  30. 30.
    Montgomery DC (2000) Design and analysis of experiments, 5th edn. Wiley, New YorkGoogle Scholar
  31. 31.
    Moon IK, Cha BC, Bae HC (2006) Hybrid genetic algorithm for group technology economic lot scheduling problem. Int J Prod Res 44:4551–4568zbMATHCrossRefGoogle Scholar
  32. 32.
    Nahmias S (1978) Perishable inventory theory: a review. Oper Res 30:680–708CrossRefGoogle Scholar
  33. 33.
    Phadke MS (1989) Quality engineering using robust design. Prentice-Hall, Engelwood CliffsGoogle Scholar
  34. 34.
    Pohlheim H (2001) Evolutionary algorithms: principles, methods, and algorithms [online]. Available from: http://www.geatbx.com/index.html, [accessed on 6 May 2004].
  35. 35.
    Raafat F (1991) Survey of literature on continuously deteriorating inventory models. J Oper Res Soc 42:27–37zbMATHGoogle Scholar
  36. 36.
    Roundy R (1984) Rounding off to powers of two in continuous relaxations of capacitated lot sizing problems. Manag Sci 35:1433–1442MathSciNetCrossRefGoogle Scholar
  37. 37.
    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.
  38. 38.
    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
  39. 39.
    Taguchi G (1986) Introduction to quality engineering. Asian Productivity, White PlainsGoogle Scholar
  40. 40.
    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
  41. 41.
    Yao MJ, Elmaghraby SE (2001) The economic lot scheduling problem under power-of-two policy. Comput Math Appl (CMWA) 41:1379–1393MathSciNetzbMATHCrossRefGoogle Scholar
  42. 42.
    Yao MJ, Elmaghraby SE, Chen IC (2003) On the feasibility testing of the economic lot scheduling problem using the extended basic period approach. J Chin Inst Ind Eng 20:435–448Google Scholar
  43. 43.
    Yao MJ, Huang JX (2005) Solving the economic lot scheduling problem with deteriorating items using genetic algorithms. J Food Eng 70:309–322CrossRefGoogle Scholar

Copyright information

© Springer-Verlag London Limited 2012

Authors and Affiliations

  1. 1.Department of Industrial EngineeringMazandaran University of Science and TechnologyBabolIran
  2. 2.Department of Industrial Management, Management and Accounting FacultyShahid Beheshti University, G.C.TehranIran
  3. 3.Research Institute of Food Science and TechnologyMashhadIran

Personalised recommendations