A computationally efficient approximation algorithm for feed-forward open queueing networks with blocking

DOI10.1016/0166-5316(89)90028-XzbMath0681.60100OpenAlexW1997203993MaRDI QIDQ4730588

Harry G. Perros, Patricia M. Snyder

Publication date: 1989

Published in: Performance Evaluation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-5316(89)90028-x

zbMATH Keywords

queueing networksblocking

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

An efficient two-phase approximation method for exponential tandem queueing systems with blocking, Analysis of multistation production systems with limited buffer capacity. II: The decomposition method, An approximate analysis of open tandem queueing networks with blocking and general service times, Symmetry property of the throughput in closed tandem queueing networks with finite buffers, Qeueing models for performance analysis: Selection of single station models, Buffer allocation in flow-shop-type production systems with general arrival and service patterns