Computing robust basestock levels

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.


CORC report TR-2005-09, Columbia University, November 2005



View Computing robust basestock levels