Preemptive priority queues

G. F. Yeo
1963 Journal of the Australian Mathematical Society  
S u m m a r y In this paper priority queues with K classes of customers with a preemptive repeat and a preemptive resume policy are considered. Customers arrive in independent Poisson processes, are served, within classes, in order of arrival, and have general requirements for service. Transforms of stationary waiting time and queue size distributions and busy period distributions are obtained for individual classes and for the system; the moments of the distributions are considered.
doi:10.1017/s1446788700039124 fatcat:57mfebvnvrd4lppixo4xoaczvq