The Queue M/G/1 with the Semipreemptive-Priority Queuing Discipline

This paper studies a priority queuing model in which the processing times of jobs are known upon arrival and preemption without loss of time or processing already accomplished is possible. Jobs are classified into K types according to their lengths, priority is assigned to them according to type and the length of processing remaining, and the paper obtains the expected conditional response times for jobs of each type.