A perishable inventory system with modified (S?1,S) policy and arbitrary processing times
In this article we analyze a lost sales (S?1,S) perishable system, under Poisson demands and exponential lifetimes, in which the reorders are placed at every demand epoch so as to take the inventory position back to its maximum level S. The items are replenished one at a time and the resupply time has arbitrary distribution. The various operating characteristics are obtained using Markov renewal techniques. A matrix recursive scheme is developed to determine the stationary distribution of the underlying Markov chain. The efficiency of this procedure in the determination of optimal S that minimizes the long run expected cost rate is discussed. Sensitivity analysis of various system parameters is also carried out. The analysis of perishable inventory systems, which has potential applications in various sectors of industry, is far more difficult than their infinite lifetime counterparts. In the study of perishable systems under traditional (S?1,S) policy, reorders for items are placed at demand as well as failure epochs. However, it will be more meaningful not to place orders at failure epochs, which is also practical and economical since it avoids continuous monitoring of items. This paper deals with a continuous review perishable system under a more realistic base stock policy, with variable ordering quantity and arbitrary unit resupply times. The operating characteristics of this complex model are derived using the techniques of semi-regenerative processes. A matrix recursive scheme developed to determine the stationary distribution has enabled us to code an efficient numerical program for cost optimization.
perishable inventory systems matrix recursive scheme unit resupply times modified (s?1 s) policy