fsqfindpn.m
来自「该代码为排队论工具.用于MM1,MG1等模型.」· M 代码 · 共 29 行
M
29 行
%fsqfindpn(lambda,mu,c,m,n)
% This function finds the probability there are n machines down
% (in the system) for a machine repair problem (finite source queue).
function out = fsqfindpn(lambda,mu,c,m,n)
p0 = fsqfindp0(lambda,mu,c,m);
if n == 0
pn = p0;
end
if n >= 1
if n < c
pn = nchoosek(m,n)*(lambda/mu)^n*p0;
end
end
if n >= c
if n <= m
pn = nchoosek(m,n)*(lambda/mu)^n*p0*factorial(n)/(factorial(c)*c^(n-c));
end
end
if n > m
pn = 0;
end
out = pn;
⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?