IDEAS home Printed from
   My bibliography  Save this paper

Note on "An efficient approach for solving the lot-sizing problem with time-varying storage capacities"


  • van den Heuvel, W.J.
  • Gutierrez, J.M.
  • Hwang, H.C.


In a recent paper Gutiérrez et al. (2008) show that the lot-sizing problem with inventory bounds can be solved in O(T log T) time. In this note we show that their algorithm does not lead to an optimal solution in general.

Suggested Citation

  • van den Heuvel, W.J. & Gutierrez, J.M. & Hwang, H.C., 2010. "Note on "An efficient approach for solving the lot-sizing problem with time-varying storage capacities"," Econometric Institute Research Papers EI 2010-70, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
  • Handle: RePEc:ems:eureir:21933

    Download full text from publisher

    File URL:
    Download Restriction: no

    Other versions of this item:

    References listed on IDEAS

    1. Gutiérrez, J. & Sedeí±o-Noda, A. & Colebrook, M. & Sicilia, J., 2008. "An efficient approach for solving the lot-sizing problem with time-varying storage capacities," European Journal of Operational Research, Elsevier, vol. 189(3), pages 682-693, September.
    2. 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.
    3. Stephen F. Love, 1973. "Bounded Production and Inventory Models with Piecewise Concave Costs," Management Science, INFORMS, vol. 20(3), pages 313-318, November.
    Full references (including those not matched with items on IDEAS)


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

    Cited by:

    1. repec:wly:navres:v:59:y:2012:i:3-4:p:244-253 is not listed on IDEAS
    2. 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.
    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.

    More about this item


    Inventory; inventory bounds; lot-sizing;


    Access and download statistics


    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:ems:eureir:21933. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (RePub). General contact details of provider: .

    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 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.