Open finite queueing networks with \(M/M/C/K\) parallel servers
From MaRDI portal
Publication:1317076
DOI10.1016/0305-0548(94)90092-2zbMath0789.90034OpenAlexW2057585259MaRDI QIDQ1317076
Sushant Jain, James MacGregor Smith
Publication date: 18 April 1994
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(94)90092-2
Communication networks in operations research (90B18) Queues and service in operations research (90B22) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)
Related Items (11)
Approximation of throughput in tandem queues with multiple servers and blocking ⋮ Performance optimization of open zero-buffer multi-server queueing networks ⋮ Optimization of the number of maintenance crew in a manufacturing unit ⋮ Buffer allocation for an integer nonlinear network design problem ⋮ MODELING TRAFFIC FLOWS WITH QUEUEING MODELS: A REVIEW ⋮ Analysis of tollbooth systems with two tandem skill-based servers and two vehicle types ⋮ Multi-objective routing within large scale facilities using open finite queueing networks ⋮ Optimal buffer allocation in finite closed networks with multiple servers ⋮ A recursive algorithm for generating the transition matrices of multistation multiserver exponential reliable queueing networks ⋮ Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines ⋮ Mathematical modelling of a tollbooth system with two parallel skill-based servers and two vehicle types
Cites Work
- The generalized expansion method for open finite queueing networks
- Asymptotic behavior of the expansion method for open finite queueing networks
- Simple bounds and monotonicity results for finite multi-server exponential tandem queues
- Approximate analysis of exponential queueing systems with blocking
- Approximate analysis of exponential tandem queues with blocking
- Approximate behavior of tandem queues
- The behaviour of a single queue in a general queueing network
- Generalized \(M/G/C/C\) state dependent queueing models and pedestrian traffic flows
- Combining routing and buffer allocation problems in series-parallel queueing networks
- Asymptotic bounds of throughput in series-parallel queueing networks
- On the waiting time of a two-stage queueing system with blocking
- Queueing Networks: A Survey of Their Random Processes
- An Approximation Method for Tandem Queues with Blocking
- Simple Bounds for Finite Single-Server Exponential Tandem Queues
- Some equivalencies between closed queueing networks with blocking
- An Approximate Analytical Method for General Queueing Networks
- Throughput Capacity of a Sequence of Queues with Blocking Due to Finite Waiting Room
- Congestion in Blocking Systems-A Simple Approximation Technique
- An Approximation Method for Open Restricted Queueing Networks
- Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
- State-of-the-Art—Networks of Queues—A Survey of Equilibrium Analysis
- Approximate Analysis of General Queuing Networks by Decomposition
- Approximations to Stochastic Service Systems, with an Application to a Retrial Model
- Accuracy of the Diffusion Approximation for Some Queuing Systems
- Networks of Waiting Lines
- Closed Queuing Systems with Exponential Servers
- Cyclic Queuing Systems with Restricted Length Queues
- Finite Queues in Series with Exponential or Erlang Service Times—A Numerical Approach
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Open finite queueing networks with \(M/M/C/K\) parallel servers
