A Queueing System in Which Customers Require a Random Number of Servers

Linda Green
Additional contact information
Linda Green: Columbia University, New York, New York

Operations Research, 1980, vol. 28, issue 6, 1335-1346

Abstract: We consider a multiserver queueing system in which customers request service from a random number of identical servers. In contrast to batch arrival queues, customers cannot begin service until all required servers are available. Servers assigned to the same customer may free separately. For this model, we derive the steady-state distribution for waiting time, the distribution of busy servers, and other important measures. Sufficient conditions for the existence of a steady-state distribution are also obtained.

Date: 1980
References: Add references at CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.28.6.1335 (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:28:y:1980:i:6:p:1335-1346

Access Statistics for this article

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