MAP/M/c Queue with Constant Impatient Time

We consider aMAP/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.

[1]  A. Brandt,et al.  On a Two-Queue Priority System with Impatience and its Application to a Call Center* , 1999 .

[2]  H. Tijms,et al.  A queueing system with impatient customers , 1985 .

[3]  S. Asmussen,et al.  Applied Probability and Queues , 1989 .

[4]  P. D. Finch.  Deterministic customer impatience in the queueing system GI/M/1 , 1960 .

[5]  François Baccelli,et al.  ON QUEUES WITH IMPATIENT CUSTOMERS. , 1981 .

[6]  D. Daley.  General customer impatience in the queue GI/G/ 1 , 1965 .

[7]  Vaidyanathan Ramaswami,et al.  Introduction to Matrix Analytic Methods in Stochastic Modeling , 1999, ASA-SIAM Series on Statistics and Applied Mathematics.

[8]  R. E. Stanford.  On queues with impatience , 1990, Advances in Applied Probability.

[9]  P. Lancaster,et al.  Factorization of selfadjoint matrix polynomials with constant signature , 1982 .

[10]  Boris Gnedenko,et al.  Introduction to queueing theory , 1968 .

[11]  Ali Movaghar.  On queueing with customer impatience until the beginning of service , 1996 .

[12]  Andreas Brandt,et al.  On the M(n)/M(n)/s Queue with Impatient Calls , 1999, Perform. Evaluation.

[13]  Henk C. Tijms,et al.  A Two-Moment Approximation for a Buffer Design Problem Requiring a Small Rejection Probability , 1985, Perform. Evaluation.

[14]  Mark H. A. Davis.  Piecewise‐Deterministic Markov Processes: A General Class of Non‐Diffusion Stochastic Models , 1984 .

[15]  S. Ethier,et al.  Markov Processes: Characterization and Convergence , 2005 .

[16]  S. Asmussen,et al.  Marked point processes as limits of Markovian arrival streams , 1993 .

[17]  Ali Movaghar-Rahimabadi.  On queueing with customer impatience until the beginning of service , 1998, Queueing Syst. Theory Appl..

[18]  Marcel F. Neuts,et al.  Matrix-geometric solutions in stochastic models - an algorithmic approach , 1982 .

[19]  Bara Kim,et al.  M/M/1 Queue with Impatient Customers of Higher Priority , 2001, Queueing Syst. Theory Appl..

[20]  F. Baccelli,et al.  Single-server queues with impatient customers , 1984, Advances in Applied Probability.

[21]  B. Conolly.  Structured Stochastic Matrices of M/G/1 Type and Their Applications , 1991 .

[22]  D. Y. Barrer.  Queuing with Impatient Customers and Ordered Service , 1957 .

[23]  Robert E. Stanford,et al.  Reneging Phenomena in Single Channel Queues , 1979, Math. Oper. Res..

[24]  A. W. Kemp,et al.  Applied Probability and Queues , 1989 .

[25]  V. Schmidt,et al.  EXTENDED AND CONDITIONAL VERSIONS OF THE PASTA PROPERTY , 1990 .