|
WORK IN PROGRESS
|
WIP = TH*CT
|
|
|
Cycle Time
|
CT
|
WIP/TH
|
|
Throughput
|
TH
|
WIP/CT
|
|
Bottleneck Rate
|
rb
|
=1/Max Avg Processing Time
|
|
Raw Processing Time
|
To
|
Sum of Avg Processing Time
|
|
Critical WIP
|
Wo
|
rb*To
|
|
CT BEST
|
if w<=Wo
|
To
|
|
otherwise
|
W/rb
|
|
|
TH BEST
|
if w<=Wo
|
w/To
|
|
otherwise
|
rb
|
|
CTworst
|
=w*To
|
|
|
THworst
|
1/To
|
|
|
CTpwc
|
To+((w-1)/rb)
|
|
THpwc
|
(w/(Wo+w-1))rb
|
|
Natural Proc. Time
|
to
|
|
|
STD of Nat. Proc. Time
|
σo
|
|
|
SCV of Nat. Proc. Time
|
co2
|
σo2/to2
|
|
STD of Nat. Proc. Time
|
mf
|
|
|
Mean Time to Repair
|
mr
|
|
|
STD of Time to Repair
|
σr
|
|
|
Mean Availability
|
A
|
mf/(mf+mr)
|
|
SCV of Time to Repair
|
cr2
|
σr2/mr
|
|
Mean Eff. Time with Preemptive Outages
|
te(Po)
|
to/A
|
|
SCV of Eff. Time with Preemptive Outages
|
ce(PO)2
|
co2+(1+cr2)A(1-A)*mr/to
|
|
Mean batch size
|
Ns
|
|
|
Mean batch size
|
ts
|
|
|
STD of Setup Time
|
σs
|
|
|
Mean Eff. Time with Preemptive Outages
|
te
|
te(PO)+ts/Ns
|
|
std. dev. Squared of eff. Time
|
σe2
|
te(po)2 x cd(po)2+(rs2/Ns) + (Ns-1/Ns2) x ts2
|
|
SCV of Eff. Time with Preemptive Outages
|
ce2
|
σe2/te2
|
|
Mean Utilization
|
u
|
te/ta
|
|
SCV of interarrival times
|
ca2
|
|
|
SCV of interdeparture times
|
cd2
|
1 + (1-u2) x (ca2-1) + u2(ce2-1)
|
|
CTQ
|
(ca2 + ce2)/2 x u/(1-u) x te
|
|
|
CT
|
CTQ + te
|
|
|
WIP
|
CT/ta
|
|
|
WIP
|
CT/ta
|
|
|
SCV of Effective processing time
|
ce2 = ((σo2 + (σs2/N) + (Ns-1)/Ns2 x ts2)/te
|
|
Utilization
|
u = (te/ta) = (te(np)/ta)
|
|
Utilization (coffee sho)
|
u = ra/re=te/ta
|
|
WIP (M/M/1)
|
u/(1-u)
|
|
WIP (M/M/1)
|
u/(1-u)
|
|
CT (M/M/1)
|
te/(1-u)
|
|
M
|
Memoryless or exponential
|
|
D
|
Deterministic
|
|
G
|
General
|
|
G/G/1
|
not exponential, gives approx CT and CTq
|
|
M/M/1
|
exponential, infinite source population unlimited queue length
|
No comments yet.
Cheatography n. The art of mapping complex subjects into clear, instantly navigable reference guides.