User Manual

•
C
n
= Cost of the nth unit.
•
C
1
= Cost of the first unit.
•
n = number of units.
•
r = learning factor.
•
k = ln r / ln 2
•
C
n
= C
1
n
k
ij
= the average cost of the ith through jth unit.
•
ij
=
C
1
j - i
j
k + 1
- i
k + 1
k + 1
•
This formula is only approximate and may give appreciable error at small i.
Queuing and Waiting Theory
•
n = number of servers.
• λ
= arrival rate of customers (Poisson input).
• µ
= service rate for each server (exponential service).
• ρ
= Intensity factor =
λ
/
µ
(
ρ
,n for valid results).
•
P
0
= Probability that all servers are idle.
•
P
b
= Probability that all servers are busy.
•
L
q
= Average number of customers in queue.
•
L = Average number of customers in the system (waiting and being served).
•
T
q
= Average waiting time in queue.
•
T = Average total time through the sytem.
•
P(t) = Probability of waiting longer than time t.
•
P
0
=
ρ
k
k!
+
ρ
n
n!
1 -
ρ
n
-1