Waiting Times in the Non-Preemptive Priority M/M/C Queue

Offer Kella, Uri Yechiali

Research output: Contribution to journalArticlepeer-review

53 Scopus citations


By using a probabilistic equivalence between the M/G/1 queue with multiple server's vacations and the M/M/c system, we derive the Laplace-Stieltjes transform of the waiting time of a class-k customer in the non-preemptive priority M/M/c queue where all customers have the same mean service time. We also calculate the first two moments of W.

Original languageAmerican English
Pages (from-to)257-262
Number of pages6
JournalCommunications in Statistics. Part C: Stochastic Models
Issue number2
StatePublished - 1985
Externally publishedYes


Dive into the research topics of 'Waiting Times in the Non-Preemptive Priority M/M/C Queue'. Together they form a unique fingerprint.

Cite this