排队论
数学
单位(环理论)
组合数学
传递关系
计算机科学
离散数学
统计
数学教育
出处
期刊:Operations Research
[Institute for Operations Research and the Management Sciences]
日期:1961-06-01
卷期号:9 (3): 383-387
被引量:2511
摘要
In a queuing process, let 1/λ be the mean time between the arrivals of two consecutive units, L be the mean number of units in the system, and W be the mean time spent by a unit in the system. It is shown that, if the three means are finite and the corresponding stochastic processes strictly stationary, and, if the arrival process is metrically transitive with nonzero mean, then L = λW.
科研通智能强力驱动
Strongly Powered by AbleSci AI