Mathematical modeling on minimizing the waiting time in (i,j) preemptive priority queueing system

Abstract

In this paper, we analyze the waiting time in two stage preemptive priority queueing system. The service time considered here is k-phase Erlang distribution. We have assign the priority server to the emergency customer without affecting the regular priority unit. It is possible only if the servers are independent. In this case, we derive the steady state probability of the waiting time customers in ordinary and priority unit. A numerical example is included.