Improved algorithms for a lot‐sizing problem with inventory bounds and backlogging

Hark‐Chin Hwang and Wilco van den Heuvel

Naval Research Logistics (NRL), 2012, vol. 59, issue 3‐4, 244-253

Abstract: This article considers a dynamic lot‐sizing problem with storage capacity limitation in which backlogging is allowed. For general concave procurement and inventory costs, we present an O(T2) dynamic programming algorithm where T is the length of the planning horizon. Furthermore, in case of a fixed‐charge cost structure without speculative motives, we show that the problem can be solved in O(T) time. By carefully choosing decompositions of the problems, we can use classical results like an efficient matrix searching algorithm and geometric techniques to achieve the results. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012

Date: 2012
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
https://doi.org/10.1002/nav.21485

Related works:
Working Paper: Improved Algorithms for a Lot-Sizing Problem with Inventory Bounds and Backlogging (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:wly:navres:v:59:y:2012:i:3-4:p:244-253

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().