λ = 6/小时、μ = 3/小时、c = 3 → P0 = 0.1111、Pw = 0.4444、Lq = 0.8889、L = 2.8889 三家柜员的银行:顾客平均每 10 分钟到达一位、每笔业务 20 分钟——通达量 a = 2 爱尔兰使每个柜台三分之二时间繁忙,不到一半的到达者(44.44%)需要等待,共享队列平均 0.8889 人,营业厅内平均共 2.8889 人。M/M/c queue — λ = 6 arrivals/time unit, μ = 3 services/time unit per server, c = 3 servers (stable: λ < cμ)
Offered load a = λ/μ = 2
Utilization per server ρ = a/c = 0.6667
P0 (system empty, all servers idle) = 0.1111
Erlang-C Pw (an arrival must wait) = 0.4444
Lq (expected waiting in line) = Pw·ρ/(1−ρ) = 0.8889
L (expected in system) = Lq + a = 2.8889
Wq (expected waiting time) = Lq/λ = 0.1481
W (expected time in system) = L/λ = 0.4815
Little's law checks: L = λ·W = 2.8889 ✓, Lq = λ·Wq = 0.8889 ✓
Probability all servers are busy (wait) = Pw = 0.4444
λ = 8/小时、μ = 5/小时、c = 2 → P0 = 0.1111、Pw = 0.7111、Lq = 2.8444、L = 4.4444 双服务台诊所、每台利用率 80%:通达量 a = 1.6 爱尔兰,71.11% 的到达患者需要等待,队列平均 2.8444 人,每位患者在诊所逗留 0.5556 个时间单位、其中 0.3556 为纯等待——展示 ρ 接近 1 时拥堵如何迅速加剧。M/M/c queue — λ = 8 arrivals/time unit, μ = 5 services/time unit per server, c = 2 servers (stable: λ < cμ)
Offered load a = λ/μ = 1.6
Utilization per server ρ = a/c = 0.8
P0 (system empty, all servers idle) = 0.1111
Erlang-C Pw (an arrival must wait) = 0.7111
Lq (expected waiting in line) = Pw·ρ/(1−ρ) = 2.8444
L (expected in system) = Lq + a = 4.4444
Wq (expected waiting time) = Lq/λ = 0.3556
W (expected time in system) = L/λ = 0.5556
Little's law checks: L = λ·W = 4.4444 ✓, Lq = λ·Wq = 2.8444 ✓
Probability all servers are busy (wait) = Pw = 0.7111