Finite Priority Queueing System with Service Interruption

Abstract

In this paper, we consider a finite buffer queueing model with preemptive resume priority and service interruption. The system may fail anytime while providing service to the priority and non-priority customers. The arrival patterns of two types of the customers are independent Poisson processes wherein the service times are exponentially distributed. The service discipline of the customers is first come first served within their own queue. Further, Runge–Kutta (R–K) method of fourth order is used to obtain the solution of the system of transient equations governing the model. Various performance measures are obtained in terms of transient probabilities such as expected number of the customers in the system, throughput, expected delay, probability of the server being idle, busy or broken down and others. The numerical results are obtained by taking an illustration to examine the effects of various system parameters on the performance measures and total expected cost.