Comparing operating characteristics of queues in which customers require a random number of servers

We examine the relative effects of several service order disciplines on important operating characteristics of queues in which customers request a random number of servers. This class of queues is characterized by customers who cannot begin service until all required servers are available. We show that for many systems in this class, it is possible to define a new service order disciplien which is more efficient than FIFO with respect to one or more measures such as expected waiting time, probability of delay, etc.