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

Offer Kella; Uri Yechiali

doi:10.1080/15326348508807014

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

Offer Kella
, Uri Yechiali

Research output: Contribution to journal › Article › peer-review

60 Scopus citations

Abstract

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 language	English
Pages (from-to)	257-262
Number of pages	6
Journal	Communications in Statistics, Stochastic Models
Volume	1
Issue number	2
DOIs	https://doi.org/10.1080/15326348508807014
State	Published - 1985
Externally published	Yes

Access to Document

10.1080/15326348508807014

Cite this

@article{38ba858114c94296afa1e4eb6b37b08a,

title = "Waiting Times in the Non-Preemptive Priority M/M/C Queue",

abstract = "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.",

author = "Offer Kella and Uri Yechiali",

year = "1985",

doi = "10.1080/15326348508807014",

language = "אנגלית",

volume = "1",

pages = "257--262",

journal = "Communications in Statistics, Stochastic Models",

issn = "0882-0287",

publisher = "Taylor \& Francis Group LLC",

number = "2",

}

TY - JOUR

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

AU - Kella, Offer

AU - Yechiali, Uri

PY - 1985

Y1 - 1985

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/0000405280

U2 - 10.1080/15326348508807014

DO - 10.1080/15326348508807014

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0000405280

SN - 0882-0287

VL - 1

SP - 257

EP - 262

JO - Communications in Statistics, Stochastic Models

JF - Communications in Statistics, Stochastic Models

IS - 2

ER -

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

Abstract

Access to Document

Other files and links

Fingerprint

Cite this