An O (N2)-time algorithm for the stochastic uncapacitated lot-sizing problem with random lead times

Ruiwei Jiang, Yongpei Guan

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

In this paper, we develop a dynamic programming algorithm for the scenario-tree-based stochastic uncapacitated lot-sizing problem with random lead times. Our algorithm runs in O(N2) time, where N is the input size of the scenario tree, and improves the recently developed algorithm that runs in O(N3) time.

Original languageEnglish (US)
Pages (from-to)74-77
Number of pages4
JournalOperations Research Letters
Volume39
Issue number1
DOIs
StatePublished - Jan 2011
Externally publishedYes

Fingerprint

Lot Sizing
Scenarios
Dynamic programming
Dynamic Programming
Random lead time
Lot sizing

Keywords

  • Dynamic programming
  • Lot-sizing
  • Random lead time
  • Stochastic programming

ASJC Scopus subject areas

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

Cite this

An O (N2)-time algorithm for the stochastic uncapacitated lot-sizing problem with random lead times. / Jiang, Ruiwei; Guan, Yongpei.

In: Operations Research Letters, Vol. 39, No. 1, 01.2011, p. 74-77.

Research output: Contribution to journalArticle

@article{e756a787545b4d2fb863100b92dc3d36,
title = "An O (N2)-time algorithm for the stochastic uncapacitated lot-sizing problem with random lead times",
abstract = "In this paper, we develop a dynamic programming algorithm for the scenario-tree-based stochastic uncapacitated lot-sizing problem with random lead times. Our algorithm runs in O(N2) time, where N is the input size of the scenario tree, and improves the recently developed algorithm that runs in O(N3) time.",
keywords = "Dynamic programming, Lot-sizing, Random lead time, Stochastic programming",
author = "Ruiwei Jiang and Yongpei Guan",
year = "2011",
month = "1",
doi = "10.1016/j.orl.2010.10.004",
language = "English (US)",
volume = "39",
pages = "74--77",
journal = "Operations Research Letters",
issn = "0167-6377",
publisher = "Elsevier",
number = "1",

}

TY - JOUR

T1 - An O (N2)-time algorithm for the stochastic uncapacitated lot-sizing problem with random lead times

AU - Jiang, Ruiwei

AU - Guan, Yongpei

PY - 2011/1

Y1 - 2011/1

N2 - In this paper, we develop a dynamic programming algorithm for the scenario-tree-based stochastic uncapacitated lot-sizing problem with random lead times. Our algorithm runs in O(N2) time, where N is the input size of the scenario tree, and improves the recently developed algorithm that runs in O(N3) time.

AB - In this paper, we develop a dynamic programming algorithm for the scenario-tree-based stochastic uncapacitated lot-sizing problem with random lead times. Our algorithm runs in O(N2) time, where N is the input size of the scenario tree, and improves the recently developed algorithm that runs in O(N3) time.

KW - Dynamic programming

KW - Lot-sizing

KW - Random lead time

KW - Stochastic programming

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

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

U2 - 10.1016/j.orl.2010.10.004

DO - 10.1016/j.orl.2010.10.004

M3 - Article

AN - SCOPUS:78650792113

VL - 39

SP - 74

EP - 77

JO - Operations Research Letters

JF - Operations Research Letters

SN - 0167-6377

IS - 1

ER -