Some properties of the throughput function of closed networks of queues
type: Item
instance of: scholarly article
title: Some properties of the throughput function of closed networks of queues
zbMATH Open document ID: 0569.90029
DOI: 10.1016/0167-6377(85)90007-0
published in: Operations Research Letters
publication date: 1985-01-01T00:00:00Z
review text: The throughput function of a closed network of queues is shown to be Schur concave and arrangement increasing. As a consequence of these properties, loading and server-assignment policies can be compared based on the majorization and the arrangement orderings. Implications of the results are discussed.
Mathematics Subject Classification ID: 90B22
Mathematics Subject Classification ID: 60K25
Mathematics Subject Classification ID: 60K20
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 3910103
zbMATH Keywords: Schur convexity
zbMATH Keywords: throughput function
zbMATH Keywords: closed network of queues
zbMATH Keywords: arrangement increasing
zbMATH Keywords: majorization
author: David D. Yao
MaRDI profile type: Publication
full work available at URL: 0167-6377(85)90007-0
OpenAlex ID: W2094839229
cites work: Q3944001
cites work: Inequalities: theory of majorization and its applications
cites work: A Generalization of a Theorem of Newton
description: scientific article; zbMATH DE number 3910103