Heuristic analysis of closed queueing networks
From MaRDI portal
Publication:3330944
DOI10.1080/00207548308942403zbMath0542.90039OpenAlexW2065644712MaRDI QIDQ3330944
J. George Shanthikumar, Mehmet Gocmen
Publication date: 1983
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207548308942403
sensitivityclosed queueing networksheuristic analysisgeneral service time distributionsiterative approximation procedurecalculation of steady-state characteristicsdecomposition approximation
Queues and service in operations research (90B22) Deterministic network models in operations research (90B10) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)
Related Items
The exponentialization approach to flexible manufacturing system models with general processing times, On queueing network models of flexible manufacturing systems, Estimating the throughput of a cyclic assembly system, Estimating variance of output from cyclic exponential queueing systems, Heuristic methods and applications: A categorized survey, Modelling the performance of flexible manufacturing systems
Cites Work
- An Approximate Analytical Method for General Queueing Networks
- Approximate Analysis of General Queuing Networks
- Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
- On Approximate Computer System Models
- Accuracy of the Diffusion Approximation for Some Queuing Systems
- Closed Queuing Systems with Exponential Servers
- Closed Finite Queuing Networks with Time Lags
- Computational algorithms for closed queueing networks with exponential servers
