On the analysis of priority scheduling and its applications in the

M=G=1 queueing system

S. O. Agboola

Department of Applied Mathematics with Statistics , Bells University of Technology, Ota, Nigeria

Abstract. 

This paper presents the analysis and application of preemptive resume and non-preemptive

priorities scheduling for an M=G=1 queueing system. Our analysis is based on the fact that, in real life

problems such as telecommunication system, supermarket operation, production system, e.t.c. It is usual

to assign priorities according to the perceived importance of the customer. We consider the general case of

j  2 dierent classes of customers in which the dierent classes can have dierent service requirement. for

both preemptive resume priority and non-preemptive priority scheduling, we develop ecient algorithms to

calculate the time it takes to serve all customers of equal or higher priority that are present at the moment

a class j customer arrives, we as well obtained the following measures for the two priorities scheduling,

mean response or sojourn time of a class j customers, the number waitng in the queue, average number of

class j customers present in the system and total waiting time for a class j customer.

Keywords: preemptive resume priority scheduling, non-preemptive priority scheduling, Little's law, PASTA property.