Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Williams, T. Nonpreemptive Multi-Server Priority Queues. J Oper Res Soc 31, 1105–1107 (1980). https://doi.org/10.1057/jors.1980.206
Published:
Issue Date:
DOI: https://doi.org/10.1057/jors.1980.206