Article ID Journal Published Year Pages File Type
1143039 Operations Research Letters 2012 7 Pages PDF
Abstract

In this paper we introduce a multi-stage stochastic program that provides a lower bound on the long-run average inventory cost of a general class of assemble-to-order (ATO) inventory systems. The stochastic program also motivates a replenishment policy for these systems. Our lower bound generalizes a previous result of Doğru et al. (2010) [3] for systems with identical component replenishment lead times to those with general deterministic lead times. We provide a set of sufficient conditions under which our replenishment policy, coupled with an allocation policy, attains the lower bound (and is hence optimal). We show that these sufficient conditions hold for two examples, a single product system and a special case of the generalized W model.

Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Authors
, ,