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.
No takes yet. Share an insight, caveat, or question.
Shanthikumar et al. (1983) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: