Journal
OPERATIONS RESEARCH LETTERS
Volume 39, Issue 1, Pages 74-77Publisher
ELSEVIER
DOI: 10.1016/j.orl.2010.10.004
Keywords
Random lead time; Dynamic programming; Stochastic programming; Lot-sizing
Categories
Funding
- US National Science Foundation [CMMI-0942154, CMMI-0942156]
Ask authors/readers for more resources
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(N-2) time, where N is the input size of the scenario tree, and improves the recently developed algorithm that runs in O(N-3) time. Published by Elsevier B.V.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
