论文部分内容阅读
本文讨论了服务台可修的M/M/1/N排队系统,在指数分布的假设下,我们建立了系统稳态概率方程组,并求得了系统稳态概率的递推公式。当N较小时,从递推公式可直接得到系统稳态概率的明显表达式,由此即可获得有关排队论和可靠性的稳态数字特征。
In this paper, the service station repairable M / M / 1 / N queuing system is discussed. Under the assumption of exponential distribution, we establish the steady-state probability equations of the system and derive the recursion formula of the steady-state probability of the system. When N is small, the explicit expression of the steady-state probability of the system can be directly obtained from the recurrence formula, thus the steady-state digital features about queuing theory and reliability can be obtained.