An M/G/c queue in which the number of servers required is random

Abstract

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 available 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.