No BSD License
-
fsqfindewq(lambda,mu,c,m)
fsqfindewq(lambda,mu,c,m)
-
fsqfindld(lambda,mu,c,m)
fsqfindld(lambda,mu,c,m)
-
fsqfindldr(lambda,mu,c,m)
fsqfindldr(lambda,mu,c,m)
-
fsqfindlu(lambda,mu,c,m)
fsqfindlu(lambda,mu,c,m)
-
fsqfindp0(lambda,mu,c,m)
fsqfindp0(lambda,mu,c,m)
-
fsqfindpn(lambda,mu,c,m,n)
-
machine(lambda,mu,m,cw,cs)
-
mmcfindewq(lambda,mu,c)
mmcfindewq(lambda,mu,c)
-
mmcfindlq(lambda,mu,c)
mmcfindlq(lambda,mu,c)
-
mmcfindls(lambda,mu,c)
mmcfindls(lambda,mu,c)
-
mmcfindp0(lambda,mu,c)
mmcfindp0(lambda,mu,c)
-
mmcfindpn(lambda,mu,c,n)
mmcfindpn(lambda,mu,c,n)
-
View all files
from
Queueing Systems Toolbox
by Bill Higley
These deal with an M/M/c queue and a finite source queue
|
| fsqfindldr(lambda,mu,c,m)
|
%fsqfindldr(lambda,mu,c,m)
% This function finds the average number of machines being repaired (ldr)
% for a machine repair problem (finite source queue)
function out = fsqfindldr(lambda,mu,c,m)
p0 = fsqfindp0(lambda,mu,c,m);
firstsum = 0;
for i = 0:c-1
term = (c-i)*nchoosek(m,i)*(lambda/mu)^i*p0;
firstsum = firstsum + term;
end
ldr = c - firstsum;
out = ldr;
|
|
Contact us at files@mathworks.com