A perishable inventory system with modified (S — 1, S) policy and arbitrary processing times
Computers and Operations Research
A Markovian inventory system with random shelf time and back orders
Computers and Industrial Engineering
Accessible bibliography on retrial queues
Mathematical and Computer Modelling: An International Journal
Homogeneous finite-source retrial queues with server subject to breakdowns and repairs
Mathematical and Computer Modelling: An International Journal
Finite-source M/M/S retrial queue with search for balking and impatient customers from the orbit
Computer Networks: The International Journal of Computer and Telecommunications Networking
Journal of Computational and Applied Mathematics
A multi-server perishable inventory system with negative customer
Computers and Industrial Engineering
A finite source multi-server inventory system with service facility
Computers and Industrial Engineering
A decision support system for patient scheduling in travel vaccine administration
Decision Support Systems
Proceedings of the Winter Simulation Conference
Proceedings of the Winter Simulation Conference
Hi-index | 7.29 |
In this article, we consider a continuous review perishable inventory system with a finite number of homogeneous sources of demands. The maximum storage capacity is S. The life time of each items is assumed to be exponential. The operating policy is (s,S) policy, that is, whenever the inventory level drops to s, an order for Q(=S-s) items is placed. The ordered items are received after a random time which is distributed as exponential. We assume that demands occurring during the stock-out period enter into the orbit. These orbiting demands send out signal to compete for their demand which is distributed as exponential. The joint probability distribution of the inventory level and the number of demands in the orbit are obtained in the steady state case. Various system performance measures are derived and the results are illustrated numerically.