Some order relations in closed networks of queues with multiserver stations. (English) Zbl 0612.90042

Consider a closed network of queues of the ”product-form” type, where each station has s servers (s\(\geq 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.


90B22 Queues and service in operations research
90B10 Deterministic network models in operations research
60K20 Applications of Markov renewal processes (reliability, queueing networks, etc.)
Full Text: DOI


[1] and , Analysis and Synthesis of Computer Systems, Academic, London, 1980.
[2] Gordon, Operations Research 15 pp 252– (1967)
[3] Reversibility and Stochastic Networks, Wiley, New York, 1979.
[4] and , Finite Markov Chains, Springer-Verlag, New York, 1976.
[5] and , Inequalities: Theory of Majorization and Its Applications, Academic, New York, 1979. · Zbl 0437.26007
[6] ”Probability Models of Multi-Programmed Computer Systems,” Ph.D. dissertation, Department of Electrical Engineering, Stanford University, Stanford, CA, 1974.
[7] ”On the Superiority of Balanced Load in Flexible Manufacturing System,” Department of Industrial Engineering and Operations Research, Syracuse University, New York, 1982.
[8] Shanthikumar, European Journal of Operational Research
[9] Shanthikumar, Operations Research
[10] Stecke, European Journal of Operational Research 20 pp 68– (1985)
[11] Yao, Operations Research Letters 3 pp 313– (1985)
[12] Yao, Annals of Operations Research
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.