Computing robust basestock levels |
| |
Authors: | Daniel Bienstock,Nuri
zbay |
| |
Affiliation: | aColumbia University, New York, NY 10027, United States |
| |
Abstract: | This paper considers how to optimally set the basestock level for a single buffer when demand is uncertain, in a robust framework. We present a family of algorithms based on decomposition that scale well to problems with hundreds of time periods, and theoretical results on more general models. |
| |
Keywords: | Robust optimization Integer programming |
本文献已被 ScienceDirect 等数据库收录! |