A note on “Linear programming models for a stochastic dynamic capacitated lot sizing problem”

T.D. van Pelt, J.C. Fransoo

Research output: Contribution to journalArticleAcademicpeer-review

4 Citations (Scopus)
7 Downloads (Pure)

Abstract

Tempelmeier and Hilger (2015) study the stochastic dynamic lot sizing problem with multiple items and limited capacity. They propose a linear optimization formulation for the problem based on a piece-wise linear approximation of the non-linear functions for the expected backorders and the expected inventory on hand. Building on the work of Tempelmeier and Hilger (2015), we correct an erroneous derivation of the linear optimization problem and propose an improved model.

Original languageEnglish
Pages (from-to)13-16
Number of pages4
JournalComputers & Operations Research
Volume89
DOIs
Publication statusPublished - 1 Jan 2018

Keywords

  • Capacities
  • Dynamic demand
  • Lot sizing
  • Random demand

Fingerprint Dive into the research topics of 'A note on “Linear programming models for a stochastic dynamic capacitated lot sizing problem”'. Together they form a unique fingerprint.

Cite this