Solving general multi-class closed queuing networks using parametric decomposition
From MaRDI portal
Publication:336370
DOI10.1016/j.cor.2013.01.014zbMath1348.90206OpenAlexW2051768624MaRDI QIDQ336370
Kumar Satyam, Manjunath Kamath, Ananth Krishnamurthy
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2013.01.014
closed queuing networkmulti-class networksparametric decompositionproduct-formtwo-moment approximations
Queues and service in operations research (90B22) Deterministic network models in operations research (90B10)
Related Items
Infinite-server queueing tandem with Markovian arrival process and service depending on its state, A queue-based aggregation approach for performance evaluation of a production system with an AMHS
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Performance analysis of single stage kanban controlled production systems using parametric decomposition
- Towards better multi-class parametric-decomposition approximations for open queueing networks
- Equivalence and decomposition in queueing systems—A unified approach
- Open and Closed Models for Networks of Queues
- Multiproduct Queueing Networks with Deterministic Routing: Decomposition Approach and the Notion of Interference
- An Approximate Analytical Method for General Queueing Networks
- Mean-Value Analysis of Closed Multichain Queuing Networks
- Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
- A product-form approximation method for general closed queueing networks with several classes of customers
- A Class of Methods for Solving Nonlinear Simultaneous Equations
- Closed Queuing Systems with Exponential Servers
- Computational algorithms for closed queueing networks with exponential servers