Finite-Source Queueing Systems and their Applications
Finite-Source Queueing Systems and their Applications
Finite-Source Queueing Systems and their Applications
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
János Sztrik 2001/08/05<br />
or fraction of time an operator would be working.<br />
4. Average number of idle operators<br />
r − rUs =<br />
r�<br />
(r − n)Pn<br />
n=0<br />
5. Average number of machines waiting<br />
Q =<br />
N�<br />
n=r+1<br />
6. Average down time of machines<br />
T =<br />
<strong>Finite</strong>-<strong>Source</strong> <strong>Queueing</strong> <strong>Systems</strong> <strong>and</strong> <strong>their</strong> <strong>Applications</strong><br />
(n − r)Pn<br />
E(L)<br />
λ(N − E(L))
Change language