摘要
This paper deals with a general queueing system with many servers in steady state. Applying the method of entropy maximization with several constraints and the asymptotic property of the GI/G/c queueing systems, we provide approximate formulae for the distributions of the number of customers and the waiting time. In order to examine the accuracy of the approximate formulae, we present several numerical examples for illustration.
| 原文 | ???core.languages.en_GB??? |
|---|---|
| 頁（從 - 到） | 815-825 |
| 頁數 | 11 |
| 期刊 | Journal of the Operational Research Society |
| 卷 | 40 |
| 發行號 | 9 |
| DOIs | |
| 出版狀態 | 已出版 - 9月 1989 |