EUR > Economics & Management > ESE > View Research Paper
http://hdl.handle.net/1765/18591
series: EI 2010-17

Improved Algorithms for a Lot-Sizing Problem with Inventory Bounds and Backlogging


Research Paper
pp 1-30.
This publication is part of collection
Published by
Related Files
asset icon
(EI2010-17.pdf, 0.2MB)

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 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



Keywords


Automatically Extracted Terms
  • period
  • production
  • problem
  • period i
  • inventory
  • algorithm
  • period t
  • production period
  • point
  • lot-sizing problem
  • lot-sizing
  • demand
  • value
  • backlogging
  • regeneration period
  • regeneration
  • formula
  • envelope
  • uncapacitated lot-sizing problem
  • property


Bookmark with: