Bounds for a Dynamic-Priority Queue

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.