We consider a multistage single server queueing model with one infinite queue and two finite buffers. The primary customer on arrival joins an infinite queue. The head of the queue finding an idle server, enter into Stage I of service. A customer who found fit, pass on to Stage II with probability (Formula Presented) and those who found unfit pass on to Buffer I with complimentary probability 1-p. The customer from Buffer I after an exponential duration of time move to Buffer II. A customer in Buffer II who seems unfit again move to Buffer I. Buffer I and Buffer II individually and collectively should not exceed capacity M. On every service completion epoch, the head of Buffer II is selected for service. We also assume customer reneges from both infinite queue and from Buffer II within an exponential duration of time intervals. Customers arrive according to a Markovian arrival process (MAP). The service time follows phase type distribution. Stability condition of the system is established. Steady-state system size distribution is obtained. Some performance measures of the system are evaluated.
CITATION STYLE
Babu, D., Joshua, V. C., & Krishnamoorthy, A. (2019). A Multistage Queueing Model with Priority for Customers Become Fit. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11965 LNCS, pp. 223–233). Springer. https://doi.org/10.1007/978-3-030-36614-8_17
Mendeley helps you to discover research relevant for your work.