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.

中文翻译：

---

用 Erlang 服务时间分布对不可补充队列进行详细分析

摘要-

本文考虑一个没有索赔输入流的服务系统，即所有索赔从一开始就存在于队列中。此类声明的数量等于 θmax，而服务器的数量等于k。一项服务的时间具有Erlang分布。本文旨在计算所有服务完成之前的时间分布，以及一项索赔的平均等待时间。