Allocation of buffer capacities in queueing networks with arbitrary topologies

DOI10.1007/BF02024519zbMath0816.90063MaRDI QIDQ1315349

Raif O. Onvural, Hideaki Yamashita

Publication date: 10 March 1994

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

queueing networksservice models

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Dynamic programming (90C39)

Related Items (3)

Multi-server, Finite Waiting Room,M/G/c/KOptimization Models ⋮ Buffer allocation in general single-server queueing networks ⋮ Topological network design of general, finite, multi-server queueing networks

Uses Software

• MARCA

Cites Work

• Design of manufacturing systems using queueing models
• On equivalencies of blocking mechanisms in queueing networks with blocking
• An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and Blocking
• Finite Queues in Series with Exponential or Erlang Service Times—A Numerical Approach
• Influence of Storage Bin Capacity on the Average Standstill Time of a Production Line
• Unnamed Item

This page was built for publication: Allocation of buffer capacities in queueing networks with arbitrary topologies