Some order relations in closed networks of queues with multiserver stations

David D. Yao and Sung Chul Kim

Naval Research Logistics (NRL), 1987, vol. 34, issue 1, 53-66

Abstract: Consider a closed network of queues of the “product‐form” type, where each station has s servers (s ≥ 1 is identical for all stations). We show that the throughput function of the network is Schur concave with respect to the loading of the stations and arrangement increasing with respect to the assignment of server groups. Consequently, different loading/assignment policies can be compared under majorization/arrangement orderings and their relative merits decided according to the yields of throughput. The results can be used to support planning decisions in computer and production systems which are modeled as closed networks of queues.

Date: 1987
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/1520-6750(198702)34:13.0.CO;2-0

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:wly:navres:v:34:y:1987:i:1:p:53-66

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().