Approximation Algorithms for the Stochastic Lot-Sizing Problem with Order Lead Times
We develop new algorithmic approaches to compute provably near-optimal policies for multiperiod stochastic lot-sizing inventory models with positive lead times, general demand distributions, and dynamic forecast updates. The policies that are developed have worst-case performance guarantees of 3 and...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Institute for Operations Research and the Management Sciences (INFORMS)
2014
|
| Online Access: | http://hdl.handle.net/1721.1/87771 https://orcid.org/0000-0002-1994-4875 |