Analysis of bounds for a capacitated single-item lot-sizing problem

Jill R. Hardin*, George L. Nemhauser, Martin W P Savelsbergh

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

7 Scopus citations

Abstract

Lot-sizing problems are cornerstone optimization problems for production planning with time varying demand. We analyze the quality of bounds, both lower and upper, provided by a range of fast algorithms. Special attention is given to LP-based rounding algorithms.

Original languageEnglish (US)
Pages (from-to)1721-1743
Number of pages23
JournalComputers and Operations Research
Volume34
Issue number6 SPEC. ISS.
DOIs
StatePublished - Jun 2007

ASJC Scopus subject areas

  • Computer Science(all)
  • Modeling and Simulation
  • Management Science and Operations Research

Fingerprint Dive into the research topics of 'Analysis of bounds for a capacitated single-item lot-sizing problem'. Together they form a unique fingerprint.

Cite this