Queues with Impatient Customers

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.