An Approximation Method for Open Restricted Queueing Networks

DOI10.1287/opre.28.3.594zbMath0442.90025OpenAlexW2059798320WikidataQ113239942 ScholiaQ113239942MaRDI QIDQ3885478

Toshiharu Hasegawa, Yutaka Takahashi, Hideo Miyahara

Publication date: 1980

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

Full work available at URL: https://doi.org/10.1287/opre.28.3.594

zbMATH Keywords

approximation methodsimulationsexact calculationsPoisson arrivalsblocking probabilitiessystem performance measuresopen restricted queueing networksexponential service timeeffective service ratenode-by-node decompositionoutput ratespseudo- arrival rate

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Deterministic network models in operations research (90B10)

Related Items (24)

A decomposition approximation for finite-buffered flow lines of exponential queues ⋮ An efficient two-phase approximation method for exponential tandem queueing systems with blocking ⋮ Buffer allocation for a class of nonlinear stochastic knapsack problems ⋮ Buffer allocation for an integer nonlinear network design problem ⋮ Asymptotic behavior of the expansion method for open finite queueing networks ⋮ Error bounds on a practical approximation for finite tandem queues ⋮ Capacity planning for a network of community health services ⋮ An approximate analysis of open tandem queueing networks with blocking and general service times ⋮ Approximate analysis of exponential tandem queues with blocking ⋮ The use of decomposition techniques for the analysis of open restricted queuing networks ⋮ Time-varying tandem queues with blocking: modeling, analysis, and operational insights via fluid models with reflection ⋮ Qeueing models for performance analysis: Selection of single station models ⋮ Modelling deadlock in open restricted queueing networks ⋮ Manufacturing flow line systems: A review of models and analytical results ⋮ Performance bounds on multiserver exponential tandem queues with finite buffers ⋮ The generalized expansion method for open finite queueing networks ⋮ Tandem queues and kanban-controlled lines ⋮ Approximate decomposition for closed queueing network models of FMSs with a block-and wait and state-dependent routing mechanism ⋮ The throughput rate of multistation unreliable production lines ⋮ Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines ⋮ An analytic finite capacity queueing network model capturing the propagation of congestion and blocking ⋮ Approximation for Kanban production systems ⋮ Modelling the performance of flexible manufacturing systems ⋮ Open finite queueing networks with \(M/M/C/K\) parallel servers

This page was built for publication: An Approximation Method for Open Restricted Queueing Networks