Bounds on the Wait in a GI/M/k Queue

Shelby L. Brumelle
Additional contact information
Shelby L. Brumelle: University of British Columbia

Management Science, 1973, vol. 19, issue 7, 773-777

Abstract: The wait in a GI/M/k queue is bounded above (stochastically) by the wait in an associated GI/M/1 queue. The analysis of the single server queue is considerably easier than that of the k-server queue, and also the bounds developed for single server queues by J. F. C. Kingman and Kneale T. Marshall can be applied.

Date: 1973
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.19.7.773 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:19:y:1973:i:7:p:773-777

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().