IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v25y1997i3p355-364.html
   My bibliography  Save this article

An optimal algorithm for the basic period approach to the economic lot scheduling problem

Author

Listed:
  • Grznar, J.
  • Riggle, C.

Abstract

This paper develops a global optimum solution to the Economic Lot Scheduling Problem (ELSP) using the restrictions of the basic period approach as originally formulated by Bomberger. The ELSP is a classic problem in production which involves scheduling multiple products on a single facility, with the restriction that no two products may be produced at the same time. Ideally, a manufacturer could generate a schedule which would minimize the sum of setup and holding costs, but the complexities involved have so far precluded the attainment of such an ideal. This article presents a real time solution method for practical sized problems using the basic period version of the ELSP. The authors believe this is the first global optimal algorithm for the basic period ELSP to be presented in the literature. It is anticipated that future research will extend the idea presented in this article to cover more general approaches to the ELSP.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:jomega:v:25:y:1997:i:3:p:355-364
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305-0483(96)00056-4
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. 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.
    2. Salah E. Elmaghraby, 1978. "The Economic Lot Scheduling Problem (ELSP): Review and Extensions," Management Science, INFORMS, vol. 24(6), pages 587-598, February.
    3. Arcade, SH, 1993. "Single machine multi-product batch scheduling: Testing several solution methods," Omega, Elsevier, vol. 21(6), pages 709-711, November.
    4. 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.
    5. Earl E. Bomberger, 1966. "A Dynamic Programming Approach to a Lot Size Scheduling Problem," Management Science, INFORMS, vol. 12(11), pages 778-784, July.
    6. 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).
    7. Robert W. Haessler & Steven L. Hogue, 1976. "Note--A Note on the Single-Machine Multi-Product Lot Scheduling Problem," Management Science, INFORMS, vol. 22(8), pages 909-912, April.
    8. Mallya, R, 1992. "Multi-product scheduling on a single machine: A case study," Omega, Elsevier, vol. 20(4), pages 529-534, July.
    9. Jack Rogers, 1958. "A Computational Approach to the Economic Lot Scheduling Problem," Management Science, INFORMS, vol. 4(3), pages 264-291, April.
    10. Eilon, Samuel, 1985. "Multi-product batch production on a single machine--A problem revisited," Omega, Elsevier, vol. 13(5), pages 453-468.
    11. Møon, I, 1993. "A note of correction on "multi-product scheduling on a single machine"," Omega, Elsevier, vol. 21(5), pages 597-599, September.
    12. C. Loren Doll & D. Clay Whybark, 1973. "An Iterative Procedure for the Single-Machine Multi-Product Lot Scheduling Problem," Management Science, INFORMS, vol. 20(1), pages 50-55, September.
    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. Kim, Taebok & Hong, Yushin & Chang, Soo Young, 2006. "Joint economic procurement--production-delivery policy for multiple items in a single-manufacturer, multiple-retailer system," International Journal of Production Economics, Elsevier, vol. 103(1), pages 199-208, September.
    2. 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.
    3. 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.
    4. 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.

    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. 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.
    2. 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.
    3. 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.
    4. Salvietti, Luciano & Smith, Neale R., 2008. "A profit-maximizing economic lot scheduling problem with price optimization," European Journal of Operational Research, Elsevier, vol. 184(3), pages 900-914, February.
    5. Briskorn, Dirk & Zeise, Philipp & Packowski, Josef, 2016. "Quasi-fixed cyclic production schemes for multiple products with stochastic demand," European Journal of Operational Research, Elsevier, vol. 252(1), pages 156-169.
    6. 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.
    7. 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.
    8. 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.
    9. 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.
    10. 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.
    11. 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.
    12. 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.
    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. 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.
    15. 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.
    16. 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.
    17. 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.
    18. Robert R. Inman & Philip C. Jones & Guillermo M. Gallego, 1991. "Economic lot scheduling of fully loaded processes with external setups," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(5), pages 699-713, October.
    19. Brander, Par & Forsberg, Rolf, 2006. "Determination of safety stocks for cyclic schedules with stochastic demands," International Journal of Production Economics, Elsevier, vol. 104(2), pages 271-295, December.
    20. Guillermo Gallego & Ilkyeong Moon, 1995. "Strategic investment to reduce setup times in the economic lot scheduling problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(5), pages 773-790, August.

    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:jomega:v:25:y:1997:i:3:p:355-364. 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: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    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.