Some properties of the throughput function of closed networks of queues

DOI10.1016/0167-6377(85)90007-0zbMath0569.90029OpenAlexW2094839229MaRDI QIDQ1060944

David D. W. Yao

Publication date: 1985

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(85)90007-0

zbMATH Keywords

majorizationSchur convexityarrangement increasingclosed network of queuesthroughput function

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Deterministic network models in operations research (90B10) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items

Reducing work-in-process inventory in certain classes of flexible manufacturing systems, On queueing network models of flexible manufacturing systems, Simple bounds and monotonicity results for finite multi-server exponential tandem queues, Monotonicity of the throughput of a closed exponential queueing network in the number of jobs, Error bounds for state space truncation of finite Jackson networks, Optimal workload allocation in closed queueing networks with state dependent queues, Design of manufacturing systems using queueing models, On Throughput and Congestion Measures for Closed and Semi-Open Network of Queues Models for Flexible Manufacturing Systems, The general behavior of pull production systems: The allocation problems, Sensitivity calculation of the throughput of an FMS with rspect to the routing mix using perturbation analysis

Cites Work

• A Generalization of a Theorem of Newton
• Inequalities: theory of majorization and its applications
• Unnamed Item