SOME ORDER RELATIONS IN CLOSED NETWORKS OF QUEUES WITH MULTISERVER STATIONS

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

10 Scopus Citations
View graph of relations

Author(s)

Detail(s)

Original languageEnglish
Pages (from-to)53-66
Journal / PublicationNaval Research Logistics
Volume34
Issue number1
Publication statusPublished - Feb 1987
Externally publishedYes

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.