Elaborated Analysis of a Nonreplenishable Queue with Erlang Distribution of the Service Time
摘要
Abstract—
The present paper considers a service system without the input flow of claims, that is, all claims are present in the queue initially from the beginning. The number of such claims equals Θmax, whereas the number of servers equals k. The time of one service has the Erlang distribution. The paper aims to calculate the time distribution until the completion of all services, as well as the average waiting time of one claim.