• Title of article

    A perishable inventory system with modified (S−1,S) policy and arbitrary processing times

  • Author/Authors

    S. Kalpakam، نويسنده , , S. Shanthi، نويسنده ,

  • Issue Information
    دوهفته نامه با شماره پیاپی سال 2001
  • Pages
    19
  • From page
    453
  • To page
    471
  • Abstract
    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.
  • Keywords
    Unit resupply times , Matrix recursive scheme , S) Policy , Modified (S?1 , Perishable inventory systems
  • Journal title
    Computers and Operations Research
  • Serial Year
    2001
  • Journal title
    Computers and Operations Research
  • Record number

    927147