Many queueing situations such as computer, communications and emergency systems have the feature that customers may require service from several servers at the same time. They may thus be delayed until the required number of servers is avialable and servers may be idle when customers are waiting. We consider general server-completion-time distributions and derive approximation methods for the computation of the steady-state distribution of the number of customers in queue as well as the moments of the waiting-time distribution. Extensive computational results are reported.
Federgruen, Awi, and Linda Green. "An M/G/c queue in which the number of servers required is random." Journal of Applied Probability 21, no. 3 (September 1984): 583-601.
Each author name for a Columbia Business School faculty member is linked to a faculty research page, which lists additional publications by that faculty member.
Each topic is linked to an index of publications on that topic.