The Arrangement of Servers in an Ordered-Entry System

David D. Yao
Additional contact information
David D. Yao: Harvard University, Cambridge, Massachusetts

Operations Research, 1987, vol. 35, issue 5, 759-763

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 (search for similar items in EconPapers)
Date: 1987
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.35.5.759 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:35:y:1987:i:5:p:759-763

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().