You are not currently logged in.
Access JSTOR through your library or other institution:
Nonpreemptive Multi-Server Priority Queues
T. M. Williams
The Journal of the Operational Research Society
Vol. 31, No. 12 (Dec., 1980), pp. 1105-1107
Stable URL: http://www.jstor.org/stable/2581823
Page Count: 3
Preview not available
Hokstad recently published an approximate method for calculating the behaviour of an M/G/m queue. This note applies his results to the nonpreemptive priority situation with two priority classes having the same service-time distribution. Laplace transforms and the first two moments of the waiting-time distributions are given.
The Journal of the Operational Research Society © 1980 Operational Research Society