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

Wilco van den Heuvel, José Miguel Gutiérrez and Hark-Chin Hwang

European Journal of Operational Research, 2011, vol. 213, issue 2, 455-457

Abstract: In a recent paper Gutièrrez et al. [1] show that the lot-sizing problem with inventory bounds can be solved in time. In this note we show that their algorithm does not lead to an optimal solution in general.

Keywords: Inventory; Lot-sizing; Inventory; bounds (search for similar items in EconPapers)
Date: 2011
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221711003122
Full text for ScienceDirect subscribers only

Related works:
Working Paper: Note on "An efficient approach for solving the lot-sizing problem with time-varying storage capacities" (2011)
Working Paper: Note on "An efficient approach for solving the lot-sizing problem with time-varying storage capacities" (2010)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:213:y:2011:i:2:p:455-457

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().