Nonpreemptive multi-server priority queues
Nonpreemptive multi-server priority queues
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.
1105-1107
Williams, T.M.
fb409365-0027-4db3-b401-58a8c8992639
1980
Williams, T.M.
fb409365-0027-4db3-b401-58a8c8992639
Williams, T.M.
(1980)
Nonpreemptive multi-server priority queues.
Journal of the Operational Research Society, 31 (12), .
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 record has no associated files available for download.
More information
Published date: 1980
Identifiers
Local EPrints ID: 36862
URI: http://eprints.soton.ac.uk/id/eprint/36862
ISSN: 0160-5682
PURE UUID: 3f3e6528-d50e-4edf-b533-a6bb40fb9669
Catalogue record
Date deposited: 28 Feb 2007
Last modified: 11 Dec 2021 15:34
Export record
Contributors
Author:
T.M. Williams
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics