An O (n2) algorithm for lot sizing with inventory bounds and fixed costs

Alper Atamtürk*, Simge Küçükyavuz

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

29 Scopus citations

Abstract

We present an O (n2) dynamic programming algorithm for lot sizing with inventory bounds and fixed costs, where n is the number of time periods. The algorithm utilizes a hierarchy of two layers of value functions and improves the complexity bound of an earlier O (n3) algorithm for concave-cost and bounded inventory.

Original languageEnglish (US)
Pages (from-to)297-299
Number of pages3
JournalOperations Research Letters
Volume36
Issue number3
DOIs
StatePublished - May 2008

Keywords

  • Dynamic programming
  • Extreme points
  • Lot sizing

ASJC Scopus subject areas

  • Software
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'An O (n<sup>2</sup>) algorithm for lot sizing with inventory bounds and fixed costs'. Together they form a unique fingerprint.

Cite this