Heuristic analysis of closed queueing networks
- 1 September 1983
- journal article
- research article
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 21 (5) , 675-690
- https://doi.org/10.1080/00207548308942403
Abstract
In this paper we consider closed queueing networks having M single server queueing stations with arbitrary interconnections and general service time distributions. Here we propose an iterative approximation procedure, based on a decomposition approximation. Numerical results are reported to demonstrate the accuracy of the method. We also discuss the sensitivity of the results to the initial guess for the server utilizations.Keywords
This publication has 12 references indexed in Scilit:
- Open queueing network models of dynamic job shopsInternational Journal of Production Research, 1981
- Determination of Server Utilization in A General Two Stage Cyclic QueueA I I E Transactions, 1980
- On the approximations to the single server queueInternational Journal of Production Research, 1980
- Open, Closed, and Mixed Networks of Queues with Different Classes of CustomersJournal of the ACM, 1975
- On Approximate Computer System ModelsJournal of the ACM, 1975
- Approximate Analysis of General Queuing NetworksIBM Journal of Research and Development, 1975
- Accuracy of the Diffusion Approximation for Some Queuing SystemsIBM Journal of Research and Development, 1974
- Closed Finite Queuing Networks with Time LagsOperations Research, 1968
- Closed Queuing Systems with Exponential ServersOperations Research, 1967
- Jobshop-Like Queueing SystemsManagement Science, 1963