Bounds for a Dynamic-Priority Queue
- 1 April 1971
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 19 (2) , 461-468
- https://doi.org/10.1287/opre.19.2.461
Abstract
This paper obtains upper and lower bounds on equilibrium mean waiting times for a Poisson-input queue with the nonpreemptive dynamic-priority service discipline studied by Jackson.Keywords
This publication has 0 references indexed in Scilit: