A queueing system in which customers require a random number of servers
Adobe Acrobat PDF
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.
Source: Operations Research
Green, Linda. "A queueing system in which customers require a random number of servers." Operations Research 28, no. 6 (1980): 1335-1346.