•  
  •  
 

Abstract

A three preemptive priority queuing system is considered where customers with three priorities joined a queue according to a Poisson process. A customer with higher priority needs to enter the service immediately upon arrival. The recursive formulas approach was extended to determine the steady state probabilities of such a priority queuing system.

Share

COinS