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.

• Type: Journal
• Year: 2008
• Where: DISOPT
• Authors: Daniel Bienstock, Nuri Özbay
• Keywords: Basestock Level, DISOPT 2008, Robust Framework, Single Buffer