Key points are not available for this paper at this time.
This paper presents a model of an (s, S) inventory system in which there are two priority classes of customers. The model treats excess demands as lost sales and can accommodate an arbitrary deterministic lead time. After considering the associated Markov-chain model, an approximate, renewal-based model is derived. This approximation is used to develop a greedy heuristic which minimizes expected costs subject to a fill-rate service constraint. The paper concludes with the results of an extensive numerical test of both the accuracy of the approximation and the performance of the heuristic with respect to the true optimal solution. Results indicate good performance which deteriorates as the fill rate requirement and lead time increase.
Cohen et al. (Fri,) studied this question.