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

On dynamic lot sizing with bounded inventory for a perishable product

Author

Listed:
  • Fan, Jie
  • Ou, Jinwen

Abstract

It is well-known in the single-item dynamic lot-sizing (DLS) literature that the DLS problem for a perishable product (DLS-P) can be solved in polynomial time (see, e.g., Hsu [1]), and that the DLS problem with bounded inventory (DLS-BI) is also polynomially solvable (see, e.g., Love [2]). However, the computational complexity of the DLS problem with bounded inventory for a perishable product (DLS-BI-P) remains to be open. In this note, we answer this open problem and show that DLS-BI-P is NP-hard. Recently, Jing and Mu [20] presented an exact algorithm for an important extension of DLS-BI-P and claimed that the proposed algorithm is polynomial, while Jing and Chao [19] also developed an exact algorithm for another important extension of DLS-BI-P. In this note, we also point out that both of these two exact algorithms are exponential, and that the algorithm by Jing and Chao [19] may not generate an optimal solution in general.

Suggested Citation

  • Fan, Jie & Ou, Jinwen, 2023. "On dynamic lot sizing with bounded inventory for a perishable product," Omega, Elsevier, vol. 119(C).
    • Handle: RePEc:eee:jomega:v:119:y:2023:i:c:s0305048323000592
    DOI: 10.1016/j.omega.2023.102895
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305048323000592
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.omega.2023.102895?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. Hark-Chin Hwang & Wilco van den Heuvel & Albert Wagelmans, 2013. "The economic lot-sizing problem with lost sales and bounded inventory," IISE Transactions, Taylor & Francis Journals, vol. 45(8), pages 912-924.
    2. Alvarez, Aldair & Miranda, Pedro & Rohmer, S.U.K., 2022. "Production routing for perishable products," Omega, Elsevier, vol. 111(C).
    3. Jing, Fuying & Chao, Xiangrui, 2022. "Forecast horizons for a two-echelon dynamic lot-sizing problem," Omega, Elsevier, vol. 110(C).
    4. Harvey M. Wagner & Thomson M. Whitin, 1958. "Dynamic Version of the Economic Lot Size Model," Management Science, INFORMS, vol. 5(1), pages 89-96, October.
    5. Liu, X. & Tu, Yl., 2008. "Production planning with limited inventory capacity and allowed stockout," International Journal of Production Economics, Elsevier, vol. 111(1), pages 180-191, January.
    6. Gökçe Palak & Sandra Duni Ekşioğlu & Joseph Geunes, 2018. "Heuristic algorithms for inventory replenishment with perishable products and multiple transportation modes," IISE Transactions, Taylor & Francis Journals, vol. 50(4), pages 345-365, April.
    7. Jing, Fuying & Chao, Xiangrui, 2021. "A dynamic lot size model with perishable inventory and stockout," Omega, Elsevier, vol. 103(C).
    8. Mahmutoğulları, Özlem & Yaman, Hande, 2023. "A Branch-and-Cut Algorithm for the Inventory Routing Problem with Product Substitution," Omega, Elsevier, vol. 115(C).
    9. Stephen F. Love, 1973. "Bounded Production and Inventory Models with Piecewise Concave Costs," Management Science, INFORMS, vol. 20(3), pages 313-318, November.
    10. Vernon Ning Hsu, 2000. "Dynamic Economic Lot Size Model with Perishable Inventory," Management Science, INFORMS, vol. 46(8), pages 1159-1169, August.
    11. M. Florian & J. K. Lenstra & A. H. G. Rinnooy Kan, 1980. "Deterministic Production Planning: Algorithms and Complexity," Management Science, INFORMS, vol. 26(7), pages 669-679, July.
    Full references (including those not matched with items on IDEAS)

    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. 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.
    2. Jing, Fuying & Chao, Xiangrui, 2021. "A dynamic lot size model with perishable inventory and stockout," Omega, Elsevier, vol. 103(C).
    3. 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.
    4. Ö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.
    5. 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.
    6. Brahimi, Nadjib & Dauzere-Peres, Stephane & Najid, Najib M. & Nordli, Atle, 2006. "Single item lot sizing problems," European Journal of Operational Research, Elsevier, vol. 168(1), pages 1-16, January.
    7. 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.
    8. 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.
    9. 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.
    10. Alper Atamtürk & Dorit S. Hochbaum, 2001. "Capacity Acquisition, Subcontracting, and Lot Sizing," Management Science, INFORMS, vol. 47(8), pages 1081-1100, August.
    11. Jans, R.F. & Degraeve, Z., 2005. "Modeling Industrial Lot Sizing Problems: A Review," ERIM Report Series Research in Management ERS-2005-049-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    12. Ou, Jinwen, 2017. "Improved exact algorithms to economic lot-sizing with piecewise linear production costs," European Journal of Operational Research, Elsevier, vol. 256(3), pages 777-784.
    13. 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.
    14. Farhat, Mlouka & Akbalik, Ayse & Hadj-Alouane, Atidel B. & Sauer, Nathalie, 2019. "Lot sizing problem with batch ordering under periodic buyback contract and lost sales," International Journal of Production Economics, Elsevier, vol. 208(C), pages 500-511.
    15. Liu, X. & Tu, Yl., 2008. "Production planning with limited inventory capacity and allowed stockout," International Journal of Production Economics, Elsevier, vol. 111(1), pages 180-191, January.
    16. Jing, Fuying & Chao, Xiangrui, 2022. "Forecast horizons for a two-echelon dynamic lot-sizing problem," Omega, Elsevier, vol. 110(C).
    17. Safer, Hershel M. & Orlin, James B., 1953-, 1995. "Fast approximation schemes for multi-criteria flow, knapsack, and scheduling problems," Working papers 3757-95., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    18. Önal, Mehmet & van den Heuvel, Wilco & Dereli, Meryem Merve & Albey, Erinç, 2023. "Economic lot sizing problem with tank scheduling," European Journal of Operational Research, Elsevier, vol. 308(1), pages 166-182.
    19. Yasemin Merzifonluoğlu & Joseph Geunes & H.E. Romeijn, 2007. "Integrated capacity, demand, and production planning with subcontracting and overtime options," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(4), pages 433-447, June.
    20. Liu, Tieming, 2008. "Economic lot sizing problem with inventory bounds," European Journal of Operational Research, Elsevier, vol. 185(1), pages 204-215, February.

    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:119:y:2023:i:c:s0305048323000592. 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.