An Iterative Algorithm for a Multiple Finite-source Queueing Model with Dynamic Priority Scheduling

A multiple finite source queueing model with a single server and dynamic, non-preemptive priority service discipline is studied in this paper. The times the customers spend at the corresponding sources are exponentially distributed. The service times of the customers can follow exponential, Erlang or hyperexponential probability density function. By using results published earlier and an extension of mean value analysis, an iterative algorithm was developed to obtain approximate values of the mean waiting times in queues for the priority classes. The mean number of waiting customers and the server utilization of each class are obtained using the result of this algorithm and Little's formula. The algorithm is preferable to the earlier method, because it does not increase in complexity as the number of customer classes increases.