Technical Note—On Waiting Times for a Queue in Which Customers Require Simultaneous Service from a Random Number of Servers

Andrew F. Seila
Additional contact information
Andrew F. Seila: University of Georgia, Athens, Georgia

Operations Research, 1984, vol. 32, issue 5, 1181-1184

Abstract: We consider a queueing system, first introduced by L. Green in 1980, in which customers from a Poisson arrival stream request simultaneous service from a random number of identical servers with exponential service times. Computational formulas for the second moment of time in queue are given, along with tables of these values for selected systems. Numerical results show that the coefficient of variation for time in queue is always greater than 1 and decreases with increasing congestion.

Keywords: 705; simultaneous; service; from; random; numbers; of; servers (search for similar items in EconPapers)
Date: 1984
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.32.5.1181 (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:oropre:v:32:y:1984:i:5:p:1181-1184

Access Statistics for this article

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