Weak convergence theorems for priority queues: preemptive-resume discipline

Abstract

We shall consider a single-server queue with r priority classes of customers and a preemptive-resume discipline. In this system customers are served in order of their priority while customers of the same priority are served in order of their arrival. Higher priority customers, immediately upon arrival, replace lower priority customers at the server, while customers displaced in this way return to the server before any other customers of the same priority receive service. When a displaced customer returns to the server, his remaining service time is the uncompleted portion of his original service time (cf. Jaiswal (1968)).