Abstract

This investigation proposes a model for simple series queues with customer’s blocking. We consider a series queue with three service stations as \( S_{1},S_{2},S_{3}\) with single server at each station. No queue is allowed to form at any station. Since the model is a sequential model, all the customers require service at each station. The recursive method has been employed to obtain the steady-state probability distribution for the series queueing system analysis. For this purpose, various performance measures, namely the average numbers of customers in the queueing system, the proportion of customers entering the queueing system, average waiting time, have been obtained.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call