IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v251y2015icp404-422.html
   My bibliography  Save this article

Optimization of economic lot scheduling problem with backordering and shelf-life considerations using calibrated metaheuristic algorithms

Author

Listed:
  • Mohammadi, Maryam
  • Musa, Siti Nurmaya
  • Bahreininejad, Ardeshir

Abstract

This paper addresses the optimization of economic lot scheduling problem, where multiple items are produced on a single machine in a cyclical pattern. It is assumed that each item can be produced more than once in every cycle, each product has a shelf-life restriction, and backordering is permitted. The aim is to determine the optimal production rate, production frequency, cycle time, as well as a feasible manufacturing schedule for the family of items, and to minimize the long-run average costs. Efficient search procedures are presented to obtain the optimum solutions by employing four well-known metaheuristic algorithms, namely genetic algorithm (GA), particle swarm optimization (PSO), simulated annealing (SA), and artificial bee colony (ABC). Furthermore, to make the algorithms more effective, Taguchi method is employed to tune various parameters of the proposed algorithms. The computational performance and statistical optimization results show the effectiveness and superiority of the metaheuristic algorithms over other reported methods in the literature.

Suggested Citation

  • Mohammadi, Maryam & Musa, Siti Nurmaya & Bahreininejad, Ardeshir, 2015. "Optimization of economic lot scheduling problem with backordering and shelf-life considerations using calibrated metaheuristic algorithms," Applied Mathematics and Computation, Elsevier, vol. 251(C), pages 404-422.
    • Handle: RePEc:eee:apmaco:v:251:y:2015:i:c:p:404-422
    DOI: 10.1016/j.amc.2014.11.035
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300314015586
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2014.11.035?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Khouja, Moutaz & Michalewicz, Zgibniew & Wilmot, Michael, 1998. "The use of genetic algorithms to solve the economic lot size scheduling problem," European Journal of Operational Research, Elsevier, vol. 110(3), pages 509-524, November.
    2. Mallya, R, 1992. "Multi-product scheduling on a single machine: A case study," Omega, Elsevier, vol. 20(4), pages 529-534, July.
    3. Gregory Dobson, 1987. "The Economic Lot-Scheduling Problem: Achieving Feasibility Using Time-Varying Lot Sizes," Operations Research, INFORMS, vol. 35(5), pages 764-771, October.
    4. Jack Rogers, 1958. "A Computational Approach to the Economic Lot Scheduling Problem," Management Science, INFORMS, vol. 4(3), pages 264-291, April.
    5. C. Chandrasekaran & Chandrasekharan Rajendran & O.V. Krishnaiah Chetty & Donakonda Hanumanna, 2007. "Metaheuristics for solving economic lot scheduling problems (ELSP) using time-varying lot-sizes approach," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 1(2), pages 152-181.
    6. Wen-Lian Hsu, 1983. "On the General Feasibility Test of Scheduling Lot Sizes for Several Products on One Machine," Management Science, INFORMS, vol. 29(1), pages 93-105, January.
    7. Earl E. Bomberger, 1966. "A Dynamic Programming Approach to a Lot Size Scheduling Problem," Management Science, INFORMS, vol. 12(11), pages 778-784, July.
    8. Yan, Changyuan & Liao, Yi & Banerjee, Avijit, 2013. "Multi-product lot scheduling with backordering and shelf-life constraints," Omega, Elsevier, vol. 41(3), pages 510-516.
    9. HSU, Wen-Lian, 1983. "On the general feasibility test of scheduling lot sizes for several products on one machine," LIDAM Reprints CORE 515, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Glock, Christoph H. & Grosse, Eric H., 2021. "The impact of controllable production rates on the performance of inventory systems: A systematic review of the literature," European Journal of Operational Research, Elsevier, vol. 288(3), pages 703-720.
    2. Long Zhang & Yuzhong Zhang & Qingguo Bai, 2019. "Two-stage medical supply chain scheduling with an assignable common due window and shelf life," Journal of Combinatorial Optimization, Springer, vol. 37(1), pages 319-329, January.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Grznar, J. & Riggle, C., 1997. "An optimal algorithm for the basic period approach to the economic lot scheduling problem," Omega, Elsevier, vol. 25(3), pages 355-364, June.
    2. Chang, Ping-Teng & Yao, Ming-Jong & Huang, Shih-Fen & Chen, Chia-Tsung, 2006. "A genetic algorithm for solving a fuzzy economic lot-size scheduling problem," International Journal of Production Economics, Elsevier, vol. 102(2), pages 265-288, August.
    3. Garn, Wolfgang & Aitken, James, 2015. "Agile factorial production for a single manufacturing line with multiple products," European Journal of Operational Research, Elsevier, vol. 245(3), pages 754-766.
    4. Holmbom, Martin & Segerstedt, Anders, 2014. "Economic Order Quantities in production: From Harris to Economic Lot Scheduling Problems," International Journal of Production Economics, Elsevier, vol. 155(C), pages 82-90.
    5. Daniel Adelman & Christiane Barz, 2014. "A Unifying Approximate Dynamic Programming Model for the Economic Lot Scheduling Problem," Mathematics of Operations Research, INFORMS, vol. 39(2), pages 374-402, May.
    6. Khouja, Moutaz & Michalewicz, Zgibniew & Wilmot, Michael, 1998. "The use of genetic algorithms to solve the economic lot size scheduling problem," European Journal of Operational Research, Elsevier, vol. 110(3), pages 509-524, November.
    7. Guillermo Gallego & Robin Roundy, 1992. "The economic lot scheduling problem with finite backorder costs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(5), pages 729-739, August.
    8. Vidal-Carreras, Pilar I. & Garcia-Sabater, Jose P. & Coronado-Hernandez, Jairo R., 2012. "Economic lot scheduling with deliberated and controlled coproduction," European Journal of Operational Research, Elsevier, vol. 219(2), pages 396-404.
    9. Wagner, Michael & Smits, Sanne R., 2004. "A local search algorithm for the optimization of the stochastic economic lot scheduling problem," International Journal of Production Economics, Elsevier, vol. 90(3), pages 391-402, August.
    10. Banerjee, Avijit & Pyreddy, Vijay R. & Kim, Seung Lae, 1996. "Investment policy for multiple product setup reduction under budgetary and capacity constraints," International Journal of Production Economics, Elsevier, vol. 45(1-3), pages 321-327, August.
    11. B.C. Giri & I. Moon & W.Y. Yun, 2003. "Scheduling economic lot sizes in deteriorating production systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(6), pages 650-661, September.
    12. Carstensen, Peter, 1997. "Das Economic Lot Scheduling Problem: Überblick und LP-basiertes Verfahren," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 465, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    13. Khouja, Moutaz, 1997. "The scheduling of economic lot sizes on volume flexible production systems," International Journal of Production Economics, Elsevier, vol. 48(1), pages 73-86, January.
    14. Wagner, Bret J. & Davis, Darwin J., 2002. "A search heuristic for the sequence-dependent economic lot scheduling problem," European Journal of Operational Research, Elsevier, vol. 141(1), pages 133-146, August.
    15. Khoury, B. N. & Abboud, N. E. & Tannous, M. M., 2001. "The common cycle approach to the ELSP problem with insufficient capacity," International Journal of Production Economics, Elsevier, vol. 73(2), pages 189-199, September.
    16. Ramesh Bollapragada & Uday Rao, 1999. "Single-Stage Resource Allocation and Economic Lot Scheduling on Multiple, Nonidentical Production Lines," Management Science, INFORMS, vol. 45(6), pages 889-904, June.
    17. Beck, Fabian G. & Biel, Konstantin & Glock, Christoph H., 2019. "Integration of energy aspects into the economic lot scheduling problem," International Journal of Production Economics, Elsevier, vol. 209(C), pages 399-410.
    18. Koulamas, Christos P., 1995. "Simultaneous determination of the cutting speed and lot size values in machining systems," European Journal of Operational Research, Elsevier, vol. 84(2), pages 356-370, July.
    19. S. Ganesan & R. Uthayakumar, 2023. "An EPQ model for a single-machine multiproduct imperfect production system using a hybrid logarithmic barrier method," OPSEARCH, Springer;Operational Research Society of India, vol. 60(3), pages 1121-1152, September.
    20. Banerjee, Avijit, 2009. "Simultaneous determination of multiproduct batch and full truckload shipment schedules," International Journal of Production Economics, Elsevier, vol. 118(1), pages 111-117, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:251:y:2015:i:c:p:404-422. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.