Comparing Operating Characteristics of Queues in Which Customers Require a Random Number of Servers
研究顾客需要随机数量服务器的排队系统，比较不同服务顺序规则对等待时间、延迟概率等运行指标的影响，发现一种比FIFO更高效的规则。
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 discipline which is more efficient than FIFO with respect to one or more measures such as expected waiting time, probability of delay, etc.