Processing math: 100%

具有p-进入规则和Min(N, D, V)-策略的M/G/1排队系统容量问题研究
罗乐,唐应辉

System Capacity Optimization Design and Optimal Control Policy (N*, D*) for M/G/1 Queue with p-Entering Discipline and Min(N, D, V)-Policy
Le Luo,Yinghui Tang
图 1 p=0.9,λ=0.5,ρ=0.5,θ=0.1,c=50,h=2时, FND的变化情况