Template-Type: ReDIF-Paper 1.0
Author-Name: Hwang, H.C.
Author-Name-Last: Hwang
Author-Name-First: Hark-Chin
Author-Name: van den Heuvel, W.
Author-Name-Last: van den Heuvel
Author-Name-First: Wilco
Author-Person: pva62
Title: Improved Algorithms for a Lot-Sizing Problem with Inventory Bounds and Backlogging
Abstract: This paper considers a dynamic lot-sizing problem with storage capacity limitation in which backlogging
 is allowed. For general concave production and inventory costs, we present an O(T2) dynamic
 programming algorithm where T is the length of the planning horizon. Furthermore, for
 fixed-charge and nonspeculative costs, we provide O(Tlog T) and O(T) algorithms, respectively.
 This paper therefore concludes that the time complexity to solve the bounded inventory lot-sizing
 problem with backlogging is the same as the complexity to solve the uncapacitated lot-sizing
 problem for the commonly used cost structures
Creation-Date: 2010-03-29
File-URL: https://repub.eur.nl/pub/18591/EI2010-17.pdf
File-Format: application/pdf
Series: RePEc:ems:eureir
Number: EI 2010-17
Keywords: algorithms, inventory and production, lot-sizing, storage capacity
Handle: RePEc:ems:eureir:18591