Skip to main content
SpringerLink
Log in

Multi-item uncapacitated lot sizing problem with inventory bounds

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

We study a multi-item lot sizing problem with inventory bounds, where the production of the items is uncapacitated but a storage capacity is considered, limiting at each period the amount of products that can be held in stock. We prove that the problem is strongly NP-hard even with no holding cost and stationary setup costs. For non-speculative costs, this lot-sizing problem remains NP-hard even when restricted to only 2 periods. However, in this case, we show that it can be polynomially solved for any fixed number of items.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Akbalik, A., Kebe, S., Penz, B., Sbihi, N.: Exact methods and a heuristic for the optimization of an integrated replenishment-storage planning problem. Int. Trans. Oper. Res 15, 195–214 (2008)

    Article  MathSciNet  Google Scholar 

  2. Atamturk, A., Kucukyavuz, S.: Lot sizing with inventory bounds and fixed costs: polyhedral study and computation. Oper. Res. 53, 711–730 (2005)

    Article  Google Scholar 

  3. Atamturk, A., Kucukyavuz, S.: An \(O(n^2)\) algorithm for lot sizing with inventory bounds and fixed costs. Oper. Res. Lett. 36, 297–299 (2008)

    Article  MathSciNet  Google Scholar 

  4. Bitran, G.R., Yanasse, H.H.: Computational complexity of the capacitated lot size problem. Manage. Sci. 28(10), 1174–1186 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  5. Chen, W.H., Thizy, J.M.: Analysis of relaxations for the multi-item capacitated lotsizing problem. Ann. Oper. Res. 26, 29–72 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  6. Chu, C., Chu, F., Zhong, J., Yang, S.: A polynomial algorithm for a lot-sizing problem with backlogging, outsourcing and limited inventory. Comput. Ind. Eng. 64, 200–210 (2013)

    Article  Google Scholar 

  7. Garey, M.R., Johnson, D.S.: Computers and Intractability : A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)

    MATH  Google Scholar 

  8. Gutiérrez, J., Sedeno-Noda, A., Colebrook, M., Sicilia, J.: A new characterization for the dynamic lot size problem with bounded inventory. Comput. Oper. Res. 30, 383–395 (2002)

    Article  Google Scholar 

  9. Gutiérrez, J., Sedeno-Noda, A., Colebrook, M., Sicilia, J.: A polynomial algorithm for the production/ordering planning problem with limited storage. Comput. Oper. Res. 34, 934–937 (2007)

    Article  MATH  Google Scholar 

  10. Hwang, H.-C., van den Heuvel, W.: Improved algorithms for a lot-sizing problem with inventory bounds and backlogging. Naval Res. Logistics 59(3–4), 244–253 (2012)

    Article  Google Scholar 

  11. Levi, R., Lodi, A., Sviridenko, M.: Approximation algorithms for the capacitated multi-item lot-sizing problem via flow-cover inequalities. Math. Oper. Res. 33(2), 461–474 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  12. Love, S.F.: Bounded production and inventory models with piecewise concave costs. Manage. Sci. 20(3), 313–318 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  13. Minner, S.: A comparison of simple heuristics for multi-product dynamic demand lot-sizing with limited warehouse capacity. Int. J. Prod. Econ. 118, 305–310 (2009)

    Article  Google Scholar 

  14. Onal, M., van den Heuvel, W., Liu, T.: Economic lot sizing problem with inventory bounds. Technical Report EI 2011–40, Econometric Institute Report

  15. Pochet, Y., Wolsey, L.A.: Production Planning by Mixed Integer Programming. Springer, New York (2006)

    MATH  Google Scholar 

  16. Sedeno-Noda, A., Gutiérrez, J., Abdul-Jalbar, B., Sicilia, J.: An \(O(T log(T))\) algorithm for the dynamic lot size problem with limited storage and linear costs. Comput. Optim. Appl. 28, 311–323 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  17. Toczylowski, E.: An \(O(T^2)\) algorithm for the lot-sizing problem with limited inventory levels. IEEE Symp. Emerg. Technol. Factory Autom. 3, 78–85 (1995)

    Google Scholar 

  18. van den Heuvel, W., Gutierrez, J.M., Hwang, H.-C.: An efficient approach for solving the lot-sizing problem with time-varying storage capacities. Eur. J. Oper. Res. 213, 455–457 (2011)

    Article  MATH  Google Scholar 

  19. Wagelmans, A., van Hoesel, S., Kolen, A.: Economic lot sizing: An \(O(n log n)\) algorithm that runs in linear time in the Wagner-Whitin case. Oper. Res. 40(1), S145–156 (1992)

    Article  MATH  Google Scholar 

  20. Wolsey, L.A.: Lot-sizing with production and delivery time windows. Math. Program. Ser. A 107, 471–489 (2006)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire LGIPM, Université de Lorraine, Ile du Saulcy, 57045 , Metz, France

    Ayse Akbalik & Christophe Rapine

  2. CNRS, G-SCOP, Université Grenoble Alpes, 46 avenue Félix Viallet, 38000 , Grenoble, France

    Bernard Penz

Authors
  1. Ayse Akbalik
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bernard Penz
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Christophe Rapine
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Christophe Rapine.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Akbalik, A., Penz, B. & Rapine, C. Multi-item uncapacitated lot sizing problem with inventory bounds. Optim Lett 9, 143–154 (2015). https://doi.org/10.1007/s11590-014-0746-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-014-0746-6

Keywords

Search

Navigation