排队论数学建模.pdfVIP

ü èØ9 Ù3 ê Æï ¥A^ (, Email:fuli.he@mail.csu.edu.cn) 1 ü èXÚ AÆ †‡ ƒ 6 1.  6 M λ t k k (λt) −λt Pk (t) = e , k = 0, 1, 2, . . . k! 2.Ñ 6 M µ P (t) = µe−µt , t 0 3.Ñ ‡ ê C 4.Ñ 5 K FCFS- LCFS- GD- SIRO- PR- 5.XÚ SUNB   ê N   5 ´k „ ´  6. 1953 D.G.Kendall (a/b/c) a b c 1966 A.Lee D.G.Kendall (a/b/c) : (d/e/f ), d e N f (M/M/10) : (F CF S/10/∞) M 10 10 5 M (Markov) D: Determinis- tic E : k Erlang GI : (General Independent)G: k M/M • λ = () • µ = () • ρ = λ/µ 1 2 • Ws = • W = q • Ls = ( ) • Lq = — ½  S = {0, 1, 2, . . .} t {N (t) : t ≥ 0} ) «L§ t n ∆t() (1) n + 1(0 ≤ n +∞) λn ∆t + o(∆t) (2) n − 1(1 ≤ n +∞) µn ∆t + o(∆t) (3) S − {n − 1, n, n + 1} o(∆t), λn , µn 0 t k G) «L§ S S = {0, 1, 2, . . . , k} t n Pn (t) = P (N (t) = n), n = 0, 1, 2, . . . , t ≥ 0. t + ∆t n (1) t n t + ∆t n Pn (t)(1 − λn ∆t − µn ∆t) + o(∆t) (2) t n − 1t + ∆t n Pn−1(t)λn−1∆t + o(∆t) (3) t n + 1t + ∆t n Pn+1 (t)µn+1∆t + o(∆t) (4) t ( n − 1, n, n + 1) t + ∆t n o(∆t). Pn (t + ∆t) = Pn (t)(1 − λn ∆t − µn ∆t) + Pn−1(t)λn−1∆t + Pn+1 (t)µn+1∆t + o(∆t), n = 0