IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v223y2012i1p290-294.html
   My bibliography  Save this article

A note on “The economic lot sizing problem with inventory bounds”

Author

Listed:
  • Önal, Mehmet
  • van den Heuvel, Wilco
  • Liu, Tieming

Abstract

In a recent paper, Liu [3] considers the lot-sizing problem with lower and upper bounds on the inventory levels. He proposes an O(n2) algorithm for the general problem, and an O(n) algorithm for the special case with non-speculative motives. We show that neither of the algorithms provides an optimal solution in general. Furthermore, we propose a fix for the former algorithm that maintains the O(n2) complexity.

Suggested Citation

  • Önal, Mehmet & van den Heuvel, Wilco & Liu, Tieming, 2012. "A note on “The economic lot sizing problem with inventory bounds”," European Journal of Operational Research, Elsevier, vol. 223(1), pages 290-294.
    • Handle: RePEc:eee:ejores:v:223:y:2012:i:1:p:290-294
    DOI: 10.1016/j.ejor.2012.05.019
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221712003682
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2012.05.019?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 look for a different version below or search for a different version of it.

    Other versions of this item:

    References listed on IDEAS

    as
    1. Albert Wagelmans & Stan van Hoesel & Antoon Kolen, 1992. "Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case," Operations Research, INFORMS, vol. 40(1-supplem), pages 145-156, February.
    2. Stephen F. Love, 1973. "Bounded Production and Inventory Models with Piecewise Concave Costs," Management Science, INFORMS, vol. 20(3), pages 313-318, November.
    3. Hark‐Chin Hwang & Wilco van den Heuvel, 2012. "Improved algorithms for a lot‐sizing problem with inventory bounds and backlogging," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(3‐4), pages 244-253, April.
    4. Liu, Tieming, 2008. "Economic lot sizing problem with inventory bounds," European Journal of Operational Research, Elsevier, vol. 185(1), pages 204-215, February.
    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. Hark‐Chin Hwang & Wilco van den Heuvel, 2012. "Improved algorithms for a lot‐sizing problem with inventory bounds and backlogging," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(3‐4), pages 244-253, April.
    2. Fan, Jie & Wang, Guoqing, 2018. "Joint optimization of dynamic lot and warehouse sizing problems," European Journal of Operational Research, Elsevier, vol. 267(3), pages 849-854.
    3. José M. Gutiérrez & Beatriz Abdul-Jalbar & Joaquín Sicilia & Inmaculada Rodríguez-Martín, 2021. "Effective Algorithms for the Economic Lot-Sizing Problem with Bounded Inventory and Linear Fixed-Charge Cost Structure," Mathematics, MDPI, vol. 9(6), pages 1-21, March.
    4. Ayse Akbalik & Bernard Penz & Christophe Rapine, 2015. "Capacitated lot sizing problems with inventory bounds," Annals of Operations Research, Springer, vol. 229(1), pages 1-18, June.
    5. Brahimi, Nadjib & Absi, Nabil & Dauzère-Pérès, Stéphane & Nordli, Atle, 2017. "Single-item dynamic lot-sizing problems: An updated survey," European Journal of Operational Research, Elsevier, vol. 263(3), pages 838-863.

    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. Chung-Lun Li & Qingying Li, 2016. "Polynomial-Time Solvability of Dynamic Lot Size Problems," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(03), pages 1-20, June.
    2. José M. Gutiérrez & Beatriz Abdul-Jalbar & Joaquín Sicilia & Inmaculada Rodríguez-Martín, 2021. "Effective Algorithms for the Economic Lot-Sizing Problem with Bounded Inventory and Linear Fixed-Charge Cost Structure," Mathematics, MDPI, vol. 9(6), pages 1-21, March.
    3. Hark‐Chin Hwang & Wilco van den Heuvel, 2012. "Improved algorithms for a lot‐sizing problem with inventory bounds and backlogging," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(3‐4), pages 244-253, April.
    4. Fan, Jie & Wang, Guoqing, 2018. "Joint optimization of dynamic lot and warehouse sizing problems," European Journal of Operational Research, Elsevier, vol. 267(3), pages 849-854.
    5. Önal, Mehmet & Romeijn, H.Edwin & Sapra, Amar & van den Heuvel, Wilco, 2015. "The economic lot-sizing problem with perishable items and consumption order preference," European Journal of Operational Research, Elsevier, vol. 244(3), pages 881-891.
    6. van den Heuvel, Wilco & Gutiérrez, José Miguel & Hwang, Hark-Chin, 2011. "Note on "An efficient approach for solving the lot-sizing problem with time-varying storage capacities"," European Journal of Operational Research, Elsevier, vol. 213(2), pages 455-457, September.
    7. Hark-Chin Hwang, 2010. "Economic Lot-Sizing for Integrated Production and Transportation," Operations Research, INFORMS, vol. 58(2), pages 428-444, April.
    8. Hark-Chin Hwang, 2009. "Inventory Replenishment and Inbound Shipment Scheduling Under a Minimum Replenishment Policy," Transportation Science, INFORMS, vol. 43(2), pages 244-264, May.
    9. Laurence A. Wolsey, 2002. "Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation," Management Science, INFORMS, vol. 48(12), pages 1587-1602, December.
    10. Chung-Lun Li & Vernon Ning Hsu & Wen-Qiang Xiao, 2004. "Dynamic Lot Sizing with Batch Ordering and Truckload Discounts," Operations Research, INFORMS, vol. 52(4), pages 639-654, August.
    11. H. Edwin Romeijn & Dolores Romero Morales & Wilco Van den Heuvel, 2014. "Computational complexity of finding Pareto efficient outcomes for biobjective lot‐sizing models," Naval Research Logistics (NRL), John Wiley & Sons, vol. 61(5), pages 386-402, August.
    12. Alper Atamtürk & Dorit S. Hochbaum, 2001. "Capacity Acquisition, Subcontracting, and Lot Sizing," Management Science, INFORMS, vol. 47(8), pages 1081-1100, August.
    13. Brahimi, Nadjib & Absi, Nabil & Dauzère-Pérès, Stéphane & Nordli, Atle, 2017. "Single-item dynamic lot-sizing problems: An updated survey," European Journal of Operational Research, Elsevier, vol. 263(3), pages 838-863.
    14. Chitsaz, Masoud & Cordeau, Jean-François & Jans, Raf, 2020. "A branch-and-cut algorithm for an assembly routing problem," European Journal of Operational Research, Elsevier, vol. 282(3), pages 896-910.
    15. Belleflamme, Paul & Vergote, Wouter, 2016. "Monopoly price discrimination and privacy: The hidden cost of hiding," Economics Letters, Elsevier, vol. 149(C), pages 141-144.
    16. Hwang, Hark-Chin & Jaruphongsa, Wikrom, 2008. "Dynamic lot-sizing model for major and minor demands," European Journal of Operational Research, Elsevier, vol. 184(2), pages 711-724, January.
    17. Hwang, H.C., 2009. "Economic Lot-Sizing Problem with Bounded Inventory and Lost-Sales," Econometric Institute Research Papers EI 2009-01, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    18. Alper Atamtürk & Simge Küçükyavuz, 2005. "Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation," Operations Research, INFORMS, vol. 53(4), pages 711-730, August.
    19. Guan, Yongpei & Liu, Tieming, 2010. "Stochastic lot-sizing problem with inventory-bounds and constant order-capacities," European Journal of Operational Research, Elsevier, vol. 207(3), pages 1398-1409, December.
    20. Ayse Akbalik & Bernard Penz & Christophe Rapine, 2015. "Capacitated lot sizing problems with inventory bounds," Annals of Operations Research, Springer, vol. 229(1), pages 1-18, June.

    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:ejores:v:223:y:2012:i:1:p:290-294. 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/locate/eor .

    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.