You are not currently logged in.
Access JSTOR through your library or other institution:
Maximum Entropy Analysis of Multiple-Server Queueing Systems
J.-S. Wu and W. C. Chan
The Journal of the Operational Research Society
Vol. 40, No. 9 (Sep., 1989), pp. 815-825
Stable URL: http://www.jstor.org/stable/2583063
Page Count: 11
You can always find the topics here!Topics: Entropy, Customers, Approximation, Computer systems, Operations research, Probability distributions, Lagrange multipliers, Information theory, Equation roots, Method of characteristics
Were these topics helpful?See something inaccurate? Let us know!
Select the topics that are inaccurate.
Preview not available
This paper deals with a general queueing system with many servers in steady state. Applying the method of entropy maximization with several constraints and the asymptotic property of the GI/G/c queueing systems, we provide approximate formulae for the distributions of the number of customers and the waiting time. In order to examine the accuracy of the approximate formulae, we present several numerical examples for illustration.
The Journal of the Operational Research Society © 1989 Operational Research Society