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 language | English (US) |
---|---|
Pages (from-to) | 74-77 |
Number of pages | 4 |
Journal | Operations Research Letters |
Volume | 39 |
Issue number | 1 |
DOIs | |
State | Published - Jan 2011 |
Externally published | Yes |
Keywords
- Dynamic programming
- Lot-sizing
- Random lead time
- Stochastic programming
ASJC Scopus subject areas
- Software
- Management Science and Operations Research
- Industrial and Manufacturing Engineering
- Applied Mathematics