An \(O(N^2)\)-time algorithm for the stochastic uncapacitated lot-sizing problem with random lead times

DOI10.1016/j.orl.2010.10.004zbMath1207.90080OpenAlexW2017487410MaRDI QIDQ631221

Yongpei Guan, Ruiwei Jiang

Publication date: 22 March 2011

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2010.10.004

zbMATH Keywords

stochastic programmingdynamic programminglot-sizingrandom lead time

Mathematics Subject Classification ID

Stochastic programming (90C15) Dynamic programming (90C39)

Related Items (5)

Dynamic lot sizing with stochastic demand timing ⋮ Two-stage stochastic lot-sizing problem under cost uncertainty ⋮ New valid inequalities and formulations for the static joint chance-constrained lot-sizing problem ⋮ Single-item dynamic lot-sizing problems: an updated survey ⋮ A polyhedral study of the static probabilistic lot-sizing problem

Cites Work

• On stochastic lot-sizing problems with random lead times
• Introduction to Stochastic Programming
• Unnamed Item

This page was built for publication: An \(O(N^2)\)-time algorithm for the stochastic uncapacitated lot-sizing problem with random lead times