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

2 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

Fingerprint

Linear Optimization
Lot Sizing
Stochastic Dynamics
Linear programming
Programming Model
Linear Model
Backorder
Piecewise Linear Approximation
Nonlinear Function
Optimization Problem
Formulation
Stochastic dynamics
Capacitated lot-sizing
Model

Keywords

  • Capacities
  • Dynamic demand
  • Lot sizing
  • Random demand

Cite this

@article{ee2fc7f6ac86438fa66951a2510da543,
title = "A note on “Linear programming models for a stochastic dynamic capacitated lot sizing problem”",
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.",
keywords = "Capacities, Dynamic demand, Lot sizing, Random demand",
author = "{van Pelt}, T.D. and J.C. Fransoo",
year = "2018",
month = "1",
day = "1",
doi = "10.1016/j.cor.2017.06.015",
language = "English",
volume = "89",
pages = "13--16",
journal = "Computers & Operations Research",
issn = "0305-0548",
publisher = "Elsevier",

}

A note on “Linear programming models for a stochastic dynamic capacitated lot sizing problem”. / van Pelt, T.D.; Fransoo, J.C.

In: Computers & Operations Research, Vol. 89, 01.01.2018, p. 13-16.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

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

AU - van Pelt, T.D.

AU - Fransoo, J.C.

PY - 2018/1/1

Y1 - 2018/1/1

N2 - 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.

AB - 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.

KW - Capacities

KW - Dynamic demand

KW - Lot sizing

KW - Random demand

UR - http://www.scopus.com/inward/record.url?scp=85026394049&partnerID=8YFLogxK

U2 - 10.1016/j.cor.2017.06.015

DO - 10.1016/j.cor.2017.06.015

M3 - Article

AN - SCOPUS:85026394049

VL - 89

SP - 13

EP - 16

JO - Computers & Operations Research

JF - Computers & Operations Research

SN - 0305-0548

ER -