A Discrete Time Inventory System with DMAP Demands

摘要

In this paper, we consider a discrete time inventory system to which demands occur according to a Discrete time Markovian Arrival Process (D-MAP). A modified (s,S) policy is implemented to place reorders whose delivery time has geometrical distribution. There can be at most m, (a prefixed constant), pending orders and it is assumed that orders can cross. The limiting probability distribution of the inventory level is shown to have matrix geometric form. Various stationary system performance measures are derived and the total expected cost rate is calculated.