The purpose of this note is to point out that the proof in Appendix 1 of Feeney and Sherbrooke [Feeney, G. J., C. C. Sherbrooke. 1966. (s − 1, s) Inventory policy under compound poisson demand. Management Sci. 12(5, January) 391–411] can be adapted to generalize to arbitrary service a queueing formula known for exponential service [Saaty, T. L. 1961. Elements of Queueing Theory. McGraw-Hill, New York, 121.].

This paper derives the simple analytic solution to the special but important inventory problem in which the optimal policy is to reorder whenever units are demanded. The demand distribution can be any compound Poisson; the resupply distribution is arbitrary. Both the backorder case and the lost sales case are solved by generalizing a queueing theorem due to Palm. The steady state probabilities for the number of units in resupply (or repair) completely describe the item's long term behavior, and are simply the normalized values of the compound Poisson demand distribution based on the mean of the resupply distribution but not on the distribution itself. Knowledge of these state probabilities enables us to compute several measures of item supply performance as a function of the spare stock, s. Traditional inventory analysis can then be applied to minimize total cost based on estimates of holding cost and supply performance cost. The appendices contain a description of the algorithm and the computer program for calculating stuttering Poisson state probabilities and the measures of effectiveness for the backorder case. Numerical illustrations are also provided.

Correction to the article Feeney, G. J., C. C. Sherbrooke. 1966. (s − 1, s) Inventory policy under compound poisson demand. Management Sci. 12(5, January) 391–411.