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.
- Dynamic programming
- Random lead time
- Stochastic programming
ASJC Scopus subject areas
- Management Science and Operations Research
- Industrial and Manufacturing Engineering
- Applied Mathematics