AN ITERATIVE ALGORITHM FOR A MULTIPLE FINITE-SOURCE QUEUING MODEL WITH DYNAMIC PRIORITY SCHEDULING

A multiple finite source queueing model with a single server and dynam ic, non-preemptive priority service discipline is studied in this pape r. The times the customers spend at the corresponding sources are expo nentially distributed. The service times of the customers can follow e xponential, Erlang or hyperexponential probability density function. B y using results published earlier and an. extension of mean value anal ysis, an iterative algorithm was developed to obtain approximate value s of the mean waiting times in queues for the priority classes. The me an number of waiting customers and the server utilization of each clas s are obtained using the result of this algorithm and Little's formula . The algorithm is preferable to the earlier method, because it does n ot increase in complexity as the number of customer classes increases.