Some results for the queues Mx/M/c and GIx/G/c

David D. YAO

doi:10.1016/0167-6377(85)90037-9

Some results for the queues M^x/M/c and GI^x/G/c

David D. YAO

Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

15 Citations (Scopus)

Abstract

We develop for the queue M^x/M/c an upper bound for the mean queue length and lower bounds for the delay probabilities (that of an arrival group and that of an arbitrary customer in the arrival group). An approximate formula is also developed for the general bulk-arrival queue GI^x/G/c. Preliminary numerical studies have indicated excellent performance of the results. © 1985.

Original language	English
Pages (from-to)	79-83
Journal	Operations Research Letters
Volume	4
Issue number	2
DOIs	https://doi.org/10.1016/0167-6377(85)90037-9
Publication status	Published - Jun 1985
Externally published	Yes

Research Keywords

approximation
bounds
bulk arrivals multiple servers
queues

Access Output

10.1016/0167-6377(85)90037-9

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@article{2e8793dbc7174256b21df233cf88b1c4,

title = "Some results for the queues Mx/M/c and GIx/G/c",

abstract = "We develop for the queue Mx/M/c an upper bound for the mean queue length and lower bounds for the delay probabilities (that of an arrival group and that of an arbitrary customer in the arrival group). An approximate formula is also developed for the general bulk-arrival queue GIx/G/c. Preliminary numerical studies have indicated excellent performance of the results. {\textcopyright} 1985.",

keywords = "approximation, bounds, bulk arrivals multiple servers, queues",

author = "YAO, {David D.}",

year = "1985",

month = jun,

doi = "10.1016/0167-6377(85)90037-9",

language = "English",

volume = "4",

pages = "79--83",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier B.V.",

number = "2",

}

TY - JOUR

T1 - Some results for the queues Mx/M/c and GIx/G/c

AU - YAO, David D.

PY - 1985/6

Y1 - 1985/6

N2 - We develop for the queue Mx/M/c an upper bound for the mean queue length and lower bounds for the delay probabilities (that of an arrival group and that of an arbitrary customer in the arrival group). An approximate formula is also developed for the general bulk-arrival queue GIx/G/c. Preliminary numerical studies have indicated excellent performance of the results. © 1985.

AB - We develop for the queue Mx/M/c an upper bound for the mean queue length and lower bounds for the delay probabilities (that of an arrival group and that of an arbitrary customer in the arrival group). An approximate formula is also developed for the general bulk-arrival queue GIx/G/c. Preliminary numerical studies have indicated excellent performance of the results. © 1985.

KW - approximation

KW - bounds

KW - bulk arrivals multiple servers

KW - queues

UR - http://www.scopus.com/inward/record.url?scp=0022099882&partnerID=8YFLogxK

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-0022099882&origin=recordpage

U2 - 10.1016/0167-6377(85)90037-9

DO - 10.1016/0167-6377(85)90037-9

M3 - RGC 21 - Publication in refereed journal

SN - 0167-6377

VL - 4

SP - 79

EP - 83

JO - Operations Research Letters

JF - Operations Research Letters

IS - 2

ER -