Consider the following queueing scenario: Customers arrive one-at-a-time to a single server and are served in a first-come–first-served sequence (FIFO). However, customers are impatient in that if they have not completed service by a fixed time, say m, they leave the system. There is an obvious analogy with the perishable inventory problem. Identify the queue with the on hand inventory, completion of service with occurrences of demand, and the impatience time with the lifetime of the product. Hence, it is possible that such queueing models could be useful for describing some types of perishable inventory systems.
[1]
H. Kaspi,et al.
Inventory systems of perishable commodities
,
1983,
Advances in Applied Probability.
[2]
Stephen C. Graves,et al.
The Application of Queueing Theory to Continuous Perishable Inventory Systems
,
1982
.
[3]
Boris Gnedenko,et al.
Introduction to queueing theory
,
1968
.
[4]
Betsy S. Greenberg,et al.
Two-Stage Perishable Inventory Models
,
1993
.
[5]
D. Y. Barrer.
Queuing with Impatient Customers and Ordered Service
,
1957
.
[6]
Robert B. Cooper,et al.
An Introduction To Queueing Theory
,
2016
.