MAP/M/c Queue with Constant Impatient Time
Published Online:1 May 2004https://doi.org/10.1287/moor.1030.0081
Abstract
We consider a MAP/M/c queue where a customer who cannot begin to receive his service for a fixed time is lost. We find a simple Markov process by using a concept of virtual waiting time and then obtain the stationary distribution of the Markov process. We find several performance measures such as loss probability, waiting time distribution, mean waiting time, and mean queue size by using the results of the stationary distribution of the Markov process.
