A service system with two stages of waiting and feedback of customers

Abstract
Customers initially enter a service unit via a waiting room. The customers to be served are stored in a service room which is replenished by the transfer of all those in the waiting room at the points in time where the service room becomes empty. At those epochs of transfer, positive random numbers of ‘overhead customers' are also added to the service room. Algorithmically tractable expressions for the stationary distributions of queue lengths and waiting times at various embedded random epochs are derived. The discussion generalizes an earlier treatment by Takács in several directions.

This publication has 2 references indexed in Scilit: