Optimal Workload Allocation in Open Networks of Multiserver Queues
研究开放Jackson网络中多服务器队列的工作负载分配问题，证明服务器组内负载应均等、大组负载应更重，并指出服务器合并可减少拥塞、提高吞吐量，对车间调度和瓶颈分析有指导意义。
In this paper, we examine the general problem of workload allocation in an open Jackson network of multiserver queues. We show that use of the open network model leads to a separable, convex formulation of the problem with relatively simple optimality conditions. Using these conditions, we prove in general that server groups with the same number of servers should be loaded equally and larger groups should be loaded more heavily than smaller groups. It is also shown that server pooling, combining servers into larger groups, will always reduce congestion and/or increase throughput. We discuss the significance of our results for job shop applications and also for the concept of a production bottleneck. In systems with an unbalanced configuration of servers, traditional, deterministic bottleneck analysis is distinctly nonoptimal; our results provide a simple way to locate production bottlenecks in shops with significant queueing effects.