The Arrangement of Servers in an Ordered-Entry System
Operations Research · 1987 · Volume 35 · Issue 5
Abstract
We consider a service system whose servers may work at different rates (systems with “heterogeneous servers”). Jobs arriving at the system access the servers in accordance with an “entry order” that relates to the arrangement of the servers. When all servers are occupied, arriving jobs are blocked and lost. This model has applications in the study of conveyors and other circulation systems. In this paper we wish to compare various server arrangements in such systems. We represent the arrangement of servers by a permutation vector of their service rates, and develop a partial order on these vectors. By moving in the direction pointed out by this partial order, one can reduce blocked traffic, thereby improving system performance. Our results may help system designers compare directly the performance of different server arrangements.
Keywords
572 recirculation systems, 696 multichannel queues with ordered entry
Enable JavaScript for citation tools and additional paper interactions.