Professional Documents
Culture Documents
882
System Design and Analysis based on
AD and Complexity Theories
References
(1) Nam Pyo Suh, Axiomatic Design: Advances
and Applications, Oxford University Press, New
York, 2001
(2)Nam Pyo Suh, Complexity: Theory and
Applications, Oxford University Press, New
York, 2005
(3) Nam P. Suh, The Principles of Design, Oxford
University Press, 1990
Your name
Your field
Why?
Format/Assumptions
1. Active Learning
2. Project execution
3. Will assume no prior knowledge of
Axiomatic Design and Complexity
Theory.
Lecture 1
Introduction to
Axiomatic Design
Todays Lecture
1.
2.
Demands in Industry
Industrial competitiveness demands that
1. Shorten the lead-time for the introduction
of new products,
2. Lower manufacturing cost,
3. Improve the quality and reliability of
products,
4. Satisfy the required functions most
effectively.
Hardware, software, and systems must be designed right to be
controllable, reliable, manufacturable, productive, and otherwise
achieve their goals. The performance of poorly designed hardware,
software and systems cannot be improved through subsequent
corrective actions.
2.
3.
Y
Y = G ~
~ G = H-1 for GH >> 1
X
1+GH GH
100 %
80 %
T im e
%
Compl
Cost of
D evelp.
100 %
80%
Tim e
Cost of
Develp.
100 %
80%
Time
Cu 5
Cu 4
Cu 3
Cu 2
Cu 1
W1
Reference: D. Edelstein et al., Tech. Dig. IEEE Int. Elec. Dev. Mtg., Washington D.C.,
pp. 773-776 (1997).
History
Goal
To establish the science base for
areas such as design and
manufacturing
Axiomatic approach
Algorithmic approach
Axiomatic Design
Axiomatic Design
Axiomatic Design helps the design
decision making process.
Correct decisions
Shorten lead time
Improves the quality of products
Deal with complex systems
Simplify service and maintenance
Enhances creativity
Axiomatic Design
Axioms
Corollaries
Theorems
Applications
--
System design
Complexity
hardware,
software,
Introduction
Stack of modules
Track
Robot
Loading
Station
Stack of modules
Unloading
station
System integration
Stack of modules
S ta ck o f m o d u le s
Track
Robot
Loading
Station
Stack of modules
M a ch in e A
F ig u re 3
S ta ck o f m o d u le s
M a ch in e B
Engine Design
Consider spark-ignition internal
engine used in passenger cars.
1.
combustion
2.
What are the functional requirements (FRs)
of an IC engine?
3.
Functional Requirements of
a Spark-Ignition IC Engine
1. Maximize fuel efficiency
2. Eliminate hydrocarbon emission
3. Minimize CO emission
4. Minimize NOx emission
Software -- Acclaro
Review
of
problems.
special
homework
Slot
Milled Flat
End of the
shaft
Metal
Shaft
Injection
molded
n y lon Knob
(b)
(a)
Section view AA
Slot
Milled Flat
End of the
shaft
Metal
Shaft
Injection
molded
n y lon Knob
(b)
(a)
Section view AA
Societal
Need
Recognize and
Formalize
(code)
Analyze
and/or Test
Compare
Reformulate
Ideate and
Create
Shortcomings:
discrepancies,
failure to improve
Product,
prototype, process
Definition of Design
Design is an interplay between
what we want to achieve and
how we want to achieve them.
Definition of Design
"What
we want
to
achieve"
"How
we want
to
achieve
them"
Example - Solution
The answer is "No. The following table lists the preferences indicated
by Smith, Kim and Stein:
Individuals
Smith
Kim
Stein
Group preference
Preferences
A>B>C, A>C
B>C>A, B>A
C>A>B, C>B
Choices
A vs. B
B vs. C
A
B
B
B
A
C
A >B
B>C
A vs. C
A
C
C
C>A
{CAs}
{FRs}
{DP}
Mapping
Customer domain
Mapping
Functional domain
{PVs}
Mapping
Physical domain
Process domain
Fig. 1.1 Four Domains of the Design World. {x} are characteristic vectors of
each domain
Figure by MIT OCW.
Customer Domain
{CAs}
Functional Domain
{FRs}
Manufacturing
Attributes which
consumers desire
Materials
Desired performance
Functional
requirements
specified for the
product
Required Properties
Physical variables
which can satisfy the
functional
requirements
Micro-structure
Processes
Software
Attributes desired in
the software
Output Spec of
Program codes
Input Variables or
Algorithms Modules
Program codes
Sub-routines machine
codes compilers
modules
Organization
Customer satisfaction
Functions of the
organization
Programs or Offices
or Activities
Systems
Attribute desired of
the overall system
Functional
requirements of the
system
Machines or
components,
sub-components
Resources (human,
financial, materials,
etc.)
Business
ROI
Business goals
Business structure
Definitions
Axiom:
An axiom is a self-evident truth or fundamental
truth for which there is no counter examples or
exceptions. It cannot be derived from other laws of
nature or principles.
Corollary:
A corollary is an inference derived from axioms or
propositions that follow from axioms or other
proven propositions.
Definitions - contd
Functional Requirement:
Functional requirements (FRs) are a minimum set of
independent requirements that completely characterize the
functional needs of the product (or software, organizations,
systems, etc.) in the functional domain. By definition, each
FR is independent of every other FR at the time the FRs are
established.
Constraint:
Constraints (Cs) are bounds on acceptable solutions. There
are two kinds of constraints: input constraints and system
constraints. Input constraints are imposed as part of the
design specifications. System constraints are constraints
imposed by the system in which the design solution must
function.
Definitions - contd
Design parameter:
Design parameters (DPs) are the key physical (or
other equivalent terms in the case of software
design, etc.) variables in the physical domain that
characterize the design that satisfies the specified
FRs.
Process variable:
Process variables (PVs) are the key variables (or
other equivalent term in the case of software design,
etc.) in the process domain that characterizes the
process that can generate the specified DPs.
Axiom 2:
Design Matrix
The relationship between {FRs} and {DPs} can be
written as
{FRs}=[A] {DPs}
When the above equation is written in a differential form
as
{dFRs}=[A] {dDPs}
[A] is defined as the Design Matrix given by elements :
Aij = FRi/DPi
Example
For a matrix A:
A11 A12 A13
[ A] = A21 A22 A23
A31 A32 A33
(1.3)
0
0
A33
(1.4)
Decoupled Design
0
A11 0
[A] = A21 A22 0
A31 A32 A33
Coupled Design
All other design matrices
(1.5)
Design of Processes
{DPs}=[B] {PVs}
Constraints
What are constraints?
Constraints provide the bounds on the acceptable
design solutions and differ from the FRs in that
they do not have to be independent.
There are two kinds of constraints:
input constraints
system constraints.
1= 2
Tube between
the two rollers
Pivot
axis 1
1<2
Figure ex.1.4.a
Flexible set of
counter-rotating
grooved rollers
for bending
Sensitivity (mm/mm)
3.29
3.74
6.32
1.48
6.55
5.94
11.72
10.17
12.06
3.71
through
prototyping
and
Reliability =
346
334
1
2 F
___
(FR FR) / 2 F2
dFR
(a)
that the
F = f (DP , DP ,.... DP
1
10
10
f
f
i
x
DP
DP
+
F =
i
x
DP
DP
i =1, except i= x
DP
FR
FR1
DP1
FR2
FR11
FR12
FR121
FR122
FR123
FR1231
DP2
DP11
DP12
DP121
DP122
FR1232
Functional Domain
DP123
DP1231
DP1232
Physical Domain
Figure 1.2 Zigzagging to decompose in the functional and the physical domains and
create the FR- and DP hierarchies
Identical Design:
When two different designs satisfy the same set of
FRs and have the identical design architecture, the
designs are defined to be identical designs.
FR1 X 0DP1
FR2 0X DP2
FR22
FR21
DP22
DP21
X
X
0
X
DP1
DP2
____________________________________________________
DP12 DP11 DP13 DP22 DP21
____________________________________________________
FR12 X
0
0
0
0
FR1
FR11 X
X
0
0
0
FR13 X
0
X
0
0
_____________________________________________________
FR2
FR22 0
0
0
X
0
FR21 0
0
0
X
X
_____________________________________________
DP1
DP2
____________________________________________________
DP12 DP11 DP13
DP22 DP21
____________________________________________________
FR12
X
0
0
0
0
FR1
FR11
X
X
0
0
0
FR13
X
0
X
0
0
_____________________________________________________
FR2
FR22
X
0
0
0
0
FR21
0
0
0
X
0/X
_____________________________________________
High-level Decomposition
Functional Requirements (FR)
High-level Decomposition
(Acclaro, Courtesy of ADSI)
Design Matrix
(Software - Acclaro, Courtesy of ADSI)
=
=
FR3 00 X 0 DP3 00 X 0
FR4 000 X DP4 000 X V
Suggested Solution
Transform the system with time-dependent
combinatorial complexity
to
a system with time-dependent periodic complexity.
Review
Design process / Domain
Functional Requirements
Design Parameters
Review
Design Domain
What do
customers
want?
What do we
want to
achieve?
How
do we want to
achieve it?
How
do we want to
generate it?
Review
Review
Solution neutral
Clarity/specificity
Review
Review
Searching for a DP
Analogies
Visualization
Stimuli
Circulating ideas
Get exposed to foreign situations
Review
Design Hierarchy
Decomposition by zigzagging
FR1
FR11
FR111
FR1111
DP1
FR12
FR112
FR1112
FR1211
FR121
FR1212
DP11
FR122
DP111
DP1111
DP12
DP112
DP1112
DP1211
:
Taesik Lee 2004
DP121
DP1212
DP122
Review
Decomposition
Zigzagging
Parent-Child relationship
Information content
Design range
System range
Probability of success
(Allowable) Tolerance
Information
Contents
Design Range
Information
Contents
Information
Contents
Design Range
Specification for FR
Acceptable range of values of a chosen FR metric; Goal-post
Different from tolerance
Different from operating range
Target value (nominal), Upper bound, Lower bound
FR*
FR
Between x and y
FR
Greater than x
(Larger the better)
Taesik Lee 2004
- (or 0)
FR
Smaller than x
(Smaller the better)
Information
Contents
System Range
Here, design includes both a chosen set of DPs and the way they
deliver/affect FRs
p.d.f.
f(FR)
System Range,
p.d.f. f(FR)
FR
|sr|
FR2
Taesik Lee 2004
FR1
Information
Contents
Information content
dr u
P ( FR ) =
f ( FR ) dFR
dr l
dru
f (FR)dFR
drl
|dr|
Design
Range
p.d.f.
f(FR)
p.d.f.
f(FR)
Common
Range, AC
System
Range,
p.d.f. f(FR)
drl
dru
FR
drl
|sr|
dru
Design Range |dr|
FR
f ( FR , FR
p1, 2,..., n =
design hyperspace
If Uncoupled,
p1, 2,..., n =
L f ( FR , FR
1
dr1dr 2
drn
f ( FR )dFR
1
dr1
( FR2 )dFR2 L
dr 2
( FR1n )dFRn
drn
= p1 p 2 ... p n
Information
Contents
Information
Contents
If Decoupled,
p1, 2,..., n =
L f ( FR , FR
1
dr1dr 2
drn
L f ( FR
dr 1dr 2
drn
FR1 a O DP1
=
DP
FR
b
c
2
2
For example,
p1, 2 =
f ( FR , FR
1
)dFR1 dFR2
dr1dr 2
f ( FR
dr1dr 2
f
(
FR
FR
)
dFR
2
1
2 f ( FR1 ) dFR1
dr1dr2
Information
Contents
1
b
DP2 = FR2 DP1
c
c
1
b
= FR2 FR1
a
c
FR1 a O DP1
=
FR
2 b c DP2
Let g1 and g2 be the pdf of DP1 and DP2.
From
f ( FR ) =
1 FR
g
a a
1 FR
f ( FR1 ) = g1 1
a a
Since
b
1 FR2 a FR1
f ( FR2 | FR1 ) = g 2
c
c
p1, 2
FR2 b FR1
1
a
1 g1 ( FR1 )dFR1
= g2
dFR
2
c
a
c
a
dr1 dr 2
Information
Contents
Example
FR1 1 0 DP1
FR 2 1 1 DP 2
DP2
Design range
FR1: [-0.5 , 0.5]
FR2: [-2.0 , 2.0]
FR2
DP1
FR1
Allowable tolerance
Information
Contents
Defined for DP
Tolerances that DPs can take while FRs still remaining completely
inside design ranges
Unconditional tolerance
Conservative tolerancing
0 DP1
FR1 A11 0
DP2
FR
2
A
21
A
22
0
=
FR1
A11
FR2 A21 DP1
DP2 =
A22
FR3 A31 DP1 A32 DP2
DP3 =
A33
DP1 =
Information
Contents
Allowable tolerance
FR2
DP2
Design range
X
X
O
X
FR1
DP1 =
DP2 =
FR1
A11
FR2 A21 DP1
A22
Taesik Lee 2004
FR1 1 0 DP1
FR 2 1 1 DP 2
FR1: [-0.5,0.5]
FR2: [-2,2]
After change
DP1: [-1,1]
DP2: [-1,1.6]
Taesik Lee 2004
Information
Contents
Information
Contents
FR2
FR2
2.5
2
Joint p.d.f.
(FR1,FR2)
1.5
FR2
2.6
2
2.5
1
0.5
-1
1
-1
Joint p.d.f.
(FR1,FR2)
.6
p.d.f
0.5
FR1
FR2
-1
Design range
0.3846 p.d.f
FR1
-1
Design range
-2
(b)
-2
(a)
(b)
p.d.f
p.d.f
DP1: [-1,1]
DP2: [0,1.5]
0.5
-1
0.6
-1
-1
-2
(a)
2.6
1
(c)
0.5
-1
FR1
1
(c)
FR1
DP1: [-1,1]
DP2: [-1,1.6]
pFR1
pFR2
pFR1 pFR2
pFR1,FR2
Before
0.5
0.9583
0.4792
0.5
After
0.5
0.9654
0.4827
0.499
Information
Contents
Summary
FR
DP
FR
DP
FR
FR
DP
DP
FR
FR
FR
FR
FR
FR
FR
DP
DP
DP
DP
DP
DP
DP
Information
Contents
Information
In AD information content, by imposing design
range, FR is transformed into a binary random
variable.
ui =
1 (success) with
0 (failure)
|dr|
Design Range
Common
Range,
AC
p.d.f.
f(FR)
System Range,
p.d.f. f(FR)
P(FRi = success)
1-P(FRi = success)
drl
dru
FR
|sr
|
I(p)
7
6
5
H (p ) [bit]
I (p ) [bit]
4
3
2
1
0
0
0.2
0.4
0.6
0.8
1
0.9
0.8
0.7
0.6
0.5
0.4
0.3
0.2
0.1
0
0
P (FR =success)
0.2
0.4
0.6
0.8
P (FR =success)
(a)
(b)
Taesik Lee 2004
Robustness
Robustness
Adaptive to change
Independence Axiom
Hod Lipson, Jordan Pollack, and Nam P. Suh, "On the Origin of Modular Variation", Evolution,
Evolution, 56(8) pp. 1549-1556, 2002
Robustness
H
Angle =
Robustness
Solution:
For small ,
H + H = sin L + Lcos
H = Lcos
where is the mean value of the estimated angle, L the length of the ladder, and H the
height.
Carefully selecting parameter values can make a system much more robust at almost no
additional cost.
Robustness
Example
FR = DP2 (1 DP)
FR
0.0315
0.0787
DP
DPb = 0.259924
Taesik Lee 2004
DPc = 0.943877
Robustness
FR
r
FR
FR FR =
n +
n nr =0
DP
*
( DP DP ) +
DP = DP
FR
C
(C C )
C =C
Robustness
FR
r
FR
FR FR =
n +
n nr =0
DP
*
( DP DP ) +
DP = DP
FR
C
FR
r
FR
(C C ) =
n +
n r
C C =C *
DP
n =0
FR
( DP DP )
*
DP = DP
(C C )
C =C
Robustness
System range (particle size) moves out of the desired design range
Need to re-initialize
Robustness
S. T. Oktay and N. P. Suh, Wear debris formation and agglomeration, Journal of Tribology, 1992
Deliverables
Conceptual design solution
AD/Complexity analysis
Presentation, report
Information content
Design range
System range
Probability of success
(Allowable) Tolerance
Information
Contents
Review
Design Range
Specification for FR
Acceptable range of values of a chosen FR metric; Goal-post
Different from tolerance
Different from operating range
Target value (nominal), Upper bound, Lower bound
Review
System Range
Here, design includes both a chosen set of DPs and the way they
deliver/affect FRs
p.d.f.
f(FR)
System Range,
p.d.f. f(FR)
FR
|sr|
FR2
Taesik Lee 2005
FR1
Review
Information content
dr u
P ( FR ) =
f ( FR )dFR
dr l
dr u
f (FR)dFR
dr l
|dr|
Design Range
Common Range,
AC
p.d.f.
f(FR)
System Range,
p.d.f. f(FR)
drl
dru
|sr|
Taesik Lee 2005
FR
Review
Example
FR1 1 0 DP1
FR 2 1 1 DP 2
DP2
Design range
FR1: [-0.5 , 0.5]
FR2: [-2.0 , 2.0]
FR2
DP1
FR1
FR1 1 0 DP1
FR 2 1 1 DP 2
FR1: [-0.5,0.5]
FR2: [-2,2]
After change
DP1: U[-1,1]
DP2: U[-1,1.6]
Taesik Lee 2005
Information
Contents
Information
Contents
FR2
FR2
2.5
2
Joint p.d.f.
(FR1,FR2)
1.5
FR2
2.6
2
2.5
1
0.5
-1
1
-1
Joint p.d.f.
(FR1,FR2)
.6
0.5
FR1
FR2
p.d.f
-1
Design range
0.3846 p.d.f
FR1
-1
Design range
-2
(b)
-2
(a)
(b)
p.d.f
p.d.f
DP1: U[-1,1]
DP2: U[0,1.5]
0.5
-1
0.6
-1
-1
-2
(a)
2.6
0.5
-1
FR1
(c)
FR1
DP1: U[-1,1]
DP2: U[-1,1.6]
(c)
pFR1
pFR2
pFR1 pFR2
pFR1,FR2
Before
0.5
0.9583
0.4792
0.5
After
0.5
0.9654
0.4827
0.499
Review
Allowable tolerance
Defined for DP
Tolerances that DPs can take while FRs still remaining completely
inside design ranges
Unconditional tolerance
Conservative tolerancing
FR2
DP2
X
X
Design range
O
X
FR1
DP1 =
DP2 =
DP1
FR1
A11
FR2 A21 DP1
A22
FR 2 0.4 1 DP2
Linear tolerancing
(-0.6,2.04)
Design range
FR1: [-0.6,0.6]
FR2: [-1.8,1.8]
Statistical tolerancing
DP2
(0.6,1.56)
-0.6
0.6
DP1
Allowable tolerance
DP1: [-0.6,0.6]
DP2: [-1.56,1.56]
3 DP1 = 0.6
3 DP2 = 1.784
Taesik Lee 2005
Review
Robustness
In axiomatic design, robust design is defined as a design that always
satisfies the functional requirements,
FRi > FRi
even when there is a large random variation in the design parameter DPi.
Adaptive to change
Independence Axiom
Hod Lipson, Jordan Pollack, and Nam P. Suh, "On the Origin of Modular Variation", Evolution,
Evolution, 56(8) pp. 1549-1556, 2002
Review
L
H
Angle =
H + H = sin L + Lcos
H = Lcos
Review
r
FR
FR FR =
n +
n nr =0
DP
*
FR
( DP DP ) +
DP = DP
FR
C
FR
r
FR
(C C ) =
n +
n r
C C =C *
DP
n =0
FR
( DP DP )
*
DP = DP
(C C )
C =C
Robustness
Robustness
Two figures (6-part diagram and pair of graphs) removed for copyright reasons.
S. T. Oktay and N. P. Suh, Wear debris formation and agglomeration, Journal of Tribology, 1992
Taesik Lee 2005
February 28
Basic statistics/probability
Review
Information content
dr u
P ( FR ) =
f ( FR )dFR
dr l
dr u
f (FR)dFR
dr l
|dr|
Design Range
Common Range,
AC
p.d.f.
f(FR)
System Range,
p.d.f. f(FR)
dru
drl
|sr|
Taesik Lee 2005
FR
Normal Distribution
X ~ N(m, s2)
1s
FR
phi(z)
0.84134474
0.977249938
0.998650033
0.999968314
0.999999713
0.999999999
1-phi(z)
prob between +z, -z
0.15865526
0.68268948
0.022750062
0.954499876
0.001349967
0.997300066
3.1686E-05
0.999936628
2.87105E-07
0.999999426
9.90122E-10
0.999999998
ppm
ppb
317310.5
45500.12
2699.934
63.37207
0.57421
574.21
0.00198 1.980244
HW1, #5
Q: Information Content ?
l
p.d.f.
f(FR)
N(m,s2)
drl
(drl+dru)/2
l
u)/2 + l
drl - (dr+dr
dru
FR
dru (drl+dru)/2 + l
{dru (drl+dru)/2 + l}/s
Review
Example
FR1
1
0
DP1
FR 2
1
1
DP2
Design range
FR1: [-0.5 , 0.5]
Design range
DP2
FR2
DP1
FR1
Assuming statistical
independence between
DP1 and DP2, the joint pdf
of (DP1,DP2) is a product
of pdf(DP1) and pdf(DP2)
Taesik Lee 2005
FR1
1
0
DP1
FR 2
1
1
DP2
FR1: [-0.5,0.5]
FR2: [-2,2]
After change
DP1: U[-1,1]
DP2: U[-1,1.6]
Taesik Lee 2005
Information
Contents
Information
Contents
FR2
FR2
2.5
2
Joint p.d.f.
(FR1,FR2)
1.5
-1
FR2
2.6
2
2.5
1 pFR2
0.5
1
0.5
FR1
-1
FR2
Marginal
pdf (FR2)
Joint p.d.f.
(FR1,FR2)
.6
p.d.f
-1
Design range
Marginal
pdf (FR1)
0.5
pFR1
-1
-1
-2
(b)
-2
(a)
p.d.f
DP1: U[-1,1]
DP2: U[0,1.5]
Marginal
pdf (FR1)
0.5
pFR1
-1
FR1
(c)
FR1
DP1: U[-1,1]
DP2: U[-1,1.6]
(c)
Correct
pFR1
pFR2
pFR1 pFR2
pFR1,FR2
Before
0.5
0.9583
0.4792
0.5
After
0.5
0.9654
0.4827
0.499
Marginal
pdf (FR2)
0.3846 p.d.f
FR1
Design range
(b)
p.d.f
0.6 p
FR2
-1
-1
-2
(a)
2.6
Review
Allowable tolerance
Defined for DP
Tolerances that DPs can take while FRs still remaining completely
inside design ranges
Unconditional tolerance
Conservative tolerancing
FR2
DP2
X
X
Design range
FR1
DFR1
DDP1 =
A11
A22
Taesik Lee 2005
DP1
Design range is mapped
onto DP space
FR1
1 0
DP1
FR2
0.4 1
DP2
Linear tolerancing
(-0.6,2.04)
Design range
FR1: [-0.6,0.6]
FR2: [-1.8,1.8]
Statistical tolerancing
DP2
(0.6,1.56)
-0.6
0.6
DP1
(-0.6,-1.56)
Allowable tolerance
DP1: [-0.6,0.6]
DP2: [-1.56,1.56]
3 sDP1 = 0.6
3 sDP2 = 1.784
Taesik Lee 2005
f ( FR)dFR
(1)
dr l
P(FR) is a probability of success for the functional requirement, i.e. the probability that a
value of FR output by the designed system falls within the acceptable range. f(FR) is a
probability density function (or probability mass function in the case that the FR is a
discrete variable) of the FR. Given f(FR), integrating the function over the acceptable
range, from drl to dru, gives the probability of success. A visual illustration of this is the
following graph that we have seen many times in the class and the textbook.
|dr|
Design Range
Common Range,
AC
p.d.f.
f(FR)
System Range,
p.d.f. f(FR)
dru
drl
FR
|sr|
Figure 1. Probability of success is obtained by integrating the probability density function of the FR,
f(FR), over the Design Range. The area of the hatched section is equal to the value of the integration.
variability, data will follow the normal distribution. In statistics, this is formalized as
the Central Limit Theorem.
If a random variable, X, follows the normal distribution, N(,2), the probability of X
being between a and b is the area, A, of the hatched section in Figure 2. A can be
computed by subtracting A2 from A1 as shown in the figure.
p.d.f.
f(FR)
=
a
FR
A1 b
FR
FR
A2 a
A1 and A2 can be easily obtained by using a standard normal distribution table found
in most probability and statistics textbooks. Standard normal distribution is a normal
distribution where a random variable, Z, follows normal distribution with its mean at
0 and a variance of 1, i.e. Z ~ N(0,1). The standard normal distribution table shows
the values (numerical approximations) for integrals of the normal distribution
function.
( z ) = P( Z z ) =
f ( z )dz
(2)
P (a Z b) = A1 A2 = (b) ( a )
(3)
and the value (a) and (b) can be found from the standard normal distribution
table.
In order to use the standard normal distribution table, the random variable X~N(,2)
has to be transformed to Z~N(0,1). That can be done by the following transformation:
Z=
(4)
Thus, for any FR~N(,2), we can use the standard normal distribution table to
compute the probability of success.
For example, suppose we have designed a system that yields FR ~ N(6,1). The design
range is given as 4FR7. See Figure 3.
Design Range
p.d.f.
f(FR)
FR
Substituting the given values into equation (4), we get Z+ = 1 and Z- = -2. Thus, the
probability of success (the hatched area in Figure 3) can be computed as
76
46
P (4 FR 7) = P
Z
1
1
= P(2 Z 1) = (1) (2)
(5)
Note that (-2) equals to 1-(2) from the symmetry of the normal distribution.
Equation (5) becomes,
P (4 FR 7) = P (2 Z 1) = (1) (1 ( 2))
(6)
Reading from the standard normal distribution table, we get (1) = 0.8413 and (2)
= 0.9772. Therefore, P(4FR7) = 0.8185.
Table 1. Sigma value and its quality level. For 3 level, it is on the order of one bad output per
thousand; for 6, it is on the order of one ppb(part per billion).
z
1
2
3
4
5
6
phi(z)
0.84134474
0.977249938
0.998650033
0.999968314
0.999999713
0.999999999
1-phi(z)
prob between +z, -z
0.15865526
0.68268948
0.022750062
0.954499876
0.001349967
0.997300066
3.1686E-05
0.999936628
2.87105E-07
0.999999426
9.90122E-10
0.999999998
ppm
ppb
317310.5
45500.12
2699.934
63.37207
0.57421
574.21
0.00198 1.980244
It should be noted that equation (1) does not include any information (information as in
common use of the term) on the design parameter at all. The information content is only a
function of the distribution of the functional requirement and the design range. As the
design range is given also in a functional domain, you can see that the information
content is defined solely in a functional domain. How we achieve the FR is behind the
scene, and the information content addresses the resulting performance, i.e. how well the
functional requirement is satisfied, of the complete system. Therefore, in the strictest
sense, the true information content can only be measured by observing the output of a
complete system. This, in some sense, makes the information content less useful in
practice: if we can measure the information content only after the system design is
complete, how does it help us in the design phase? Although computing the true value of
information content is impossible before the design is finished, some qualitative
conclusions derived from the concept turn out to be useful in a design process. For
example, means to reduce the information content or the relationship between the
information content and coupling hold true regardless of our ability to compute the value
of the information content. Also, estimating information content from the knowledge
about design parameters and design matrix can be useful in comparing potential solutions.
If we assume that the variation of FRs is entirely attributed to the variation of DPs, then
we can estimate the information content of the FR given the knowledge about the DP. A
design equation for one-FR design problem is,
FR = [ A]DP = f (DP)
(7)
Given the distribution of DP and the mapping relationship from DP to FR (A or f), we can
derive the distribution of FR, a system range (Figure 4). This can be done by either the
distribution function technique or the change-of-variable technique [refer to any statistics
textbook such as the one by Hogg & Tanis]. Although it is particularly easy when the
mapping is linear or strictly in(de)creasing, it still takes some effort to do the derivation.
Instead, it is much easier to map the design range to physical domain (Figure 5) because
the design range is simply an interval rather than a function. For example, in linear
mapping, it is simply either stretching or shrinking the design range. This turns out to be
particularly convenient for multi-FR problems, which is discussed in the next section.
Distribution of
Design Parameter
p.d.f. g(DP)
p.d.f. f(FR)
Derived distribution of
Functional Requirement
DP
FR
Physical Domain
Functional Domain
Figure 4. System range can be derived from the distribution of DP. The task may become non-trivial
depending on the mapping relationship and DP distribution.
Design Range
drl
Allowable tolerance
dru
FR
cl
cu
DP
Physical Domain
Functional Domain
Figure 5. An alternative is mapping the design range onto physical domain, which can be easily done
in most cases. The mapped range in DP domain is called allowable tolerance.
The range in DP domain, mapped from the design range, is called the allowable tolerance
to avoid confusion with the design range while denoting the fact that once a DP value is
within this range, the FR values will be within the design range. The probability of
success for FR is then equal to the probability of DPs falling within the allowable
tolerance. This probability is obtained by integrating the p.d.f. of DP, g(DP), over the
allowable tolerance. (Figure 6)
p.d.f. g(DP)
Design Range
drl
dru
FR
Allowable tolerance
Functional Domain
DP
Physical Domain
Figure 6. Probability of success for FR is equal to the probability of DP's falling within the allowable
tolerance.
(8)
where p1,2,,n denotes the probability of success for all of the FRs. p1,2,,n is the
probability that the value of FR1 output by the designed system falls within FR1 design
range, the value of FR2 within FR2 design range, etc. p1,2,,n is defined as
p1, 2,..., n =
f ( FR , FR ,L, FR
1
(9)
design hyperspace
FR 2 1 1 DP 2
(10)
The design ranges for FRs are given as -0.5FR10.5 and -2FR22. The
variation of DPs is given by two uniform distribution: DP1 ~ U[-1,1] and DP2
~ U[0,1.5] where U[a,b] denotes a uniform distribution between a and b. Let
g1 denote the probability density function of DP1 and g2 be the p.d.f. of DP2.
Then, g1 and g2 are constant within the two bounds: g1 = 0.5 for -1DP11,
and g2 = 2/3 for 0DP21.5. (see Figure 7)
First, we need to assume that DPs are statistically independent to each other to
simplify the problem. Under the assumption, the joint probability density
function of (DP1,DP2), g1,2, is simply a product of two uniform probabilities.
This, again, yields a uniform p.d.f. in DP1-DP2 plane:
g1,2 (DP1,DP2) = 1/3
0
(11)
U[-1,1]
0.5
DP2
h = 1/3
1.5
1 DP1
-1
g12(DP1,DP2)
=
g1(DP1)*g2(DP2)
U[0,1.5]
2/3
h
0
-1
1.5 DP2
DP1
Figure 7. Assuming DP1 and DP2 are statistically independent to each other, the joint
p.d.f. g1,2(DP1,DP2) is a product of g1 and g2. g1,2 is another uniform density function,
i.e. constant 1/3.
Now, we can map the design range onto DP domain to obtain the allowable
tolerance (in this case, an area). The design range is represented by a rectangle
on the FR-plane (Figure 8a). From the design matrix,
FR1 = DP1
FR2 = DP1 + DP2
If we rearrange these equations such that DPs are expressed in terms of FRs,
DP1 = FR1
DP2 = -DP1 + FR2
FR1 design range is given as -0.5FR10.5. Thus, the first equation of the
above represents a vertical line in the area between -0.5DP10.5 as shown in
Figure 8b. The second equation represents a set of straight line with the slope
of -1, and its intersection with DP2 axis ranges from -2 to 2 (given by FR2
design range). See Figure 8c. Finally the allowable tolerance for DP1 and DP2
is obtained by taking intersection of 8b and 8c.
DP2
2
FR2
DP2
DP1
FR1
-0.5
0.5
DP2
DP1
DP1
-0.5
0.5
-2
-2
(a)
(b)
(c)
(d)
Figure 8. Mapping the design range onto DP space to obtain the allowable tolerance.
-1 -0.5
DP joint p.d.f.
0.5
DP1
Allowable
Tolerance
-2
Figure 9. Probability of success is the integral of g1,2 over the allowable tolerance
Assuming DPs are the only source of FR variation, we can say the probability
of success of FR1 and FR2 equals to the probability we computed above.
We know that, if the design matrix is coupled or decoupled, the probability of success for
FRs is not equal to the product of the probability of success for individual FRs: p1,2,,N
p1p2pN. This individual probability, pi, is called the marginal probability (of success) of
FRi. The marginal probability is defined based on the joint probability. For example, in a
2-FR case:
p1 =
dr u , FR1
dr l , FR1
f1 ( FR1)dFR1
(12)
f1 ( FR1) =
1, 2
( FR1, FR 2)dFR 2
f1(FR1) is called the marginal p.d.f. for FR1. Suppose we have a system that has FR1 and
FR2. Les us say we only care about FR1 and measure the FR1 samples to obtain its
distribution. Then we can compute the probability of success for FR1 by examining the
distribution with the FR1 design range. This probability is the marginal probability of
success for FR1.
It should be noted that the probability of success computed by multiplying the marginal
probabilities is not only inaccurate, but potentially misleading in drawing a conclusion
from the observation. The following example illustrates the point.
Example: Marginal probability vs. Joint probability
The two-FR design problem we saw in the earlier example is revisited.
FR1 1 0 DP1
FR 2 1 1 DP 2
(10)
h = 1/3
h = 1/2
1.5
2.5
S
L
1
h
0
-1
-1
DP1
FR1
1
-1
p.d.f. f(DP1,DP2) = h = 1/3
Figure 10. Deriving f1,2 from g1,2. DP's having the uniform distribution and its linear
mapping make it simple.
f1 ( FR1) =
3 dFR 2
for -1FR11
(13)
along FR2 axis (L in Figure 10). The figure suggests that the length is 1.5
throughout the -1FR11 range. Thus,
f1(FR1) = 1/3 * 1.5 = 0.5
0
when -1FR11
otherwise
For FR2,
f 2 ( FR 2) =
1, 2
( FR1, FR 2)dFR1 =
3 dFR1
for -1FR22.5
(14)
dFR1 is the length of the projected area along FR1 axis (S in Figure 10),
and, unlike L, S is a function of FR2. By inspecting Figure 10, you can see
that S linearly increases from 0 to 1.5 as FR2 increases from -1 to 0.5. Then,
for 0.5<FR2<1.0, S is constant at 1.5. From FR2=1.0 to FR2=2.5, S decreases
from 1.5 back to zero. S, a function of FR2, multiplied by 1/3 yields the
marginal p.d.f. f2 that has a trapezoidal shape. Figure 11 summarizes the above
discussion with the design range also shown.
FR2
FR2
2.5
2
Joint p.d.f.
(FR1,FR2)
1.5
-1
2.5
1
0.5
1
0.5
FR1
-1
p.d.f
-1
Design range
-2
(a)
(b)
p.d.f
0.5
-1
1
(c)
FR1
Figure 11. The marginal p.d.f. for FR1 and FR2 can be computed from the joint p.d.f. of
(FR1,FR2). Each of the two marginal p.d.f. is integrated within the design range to give
the marginal probability of success for FR1 and FR2, respectively.
Integrating each of the two marginal p.d.f. over its relevant design range
yields the marginal probability of success. From Figure 11, you can figure out
that p1 = 0.5 and p2 = 0.9583. Product of these two marginal probabilities is
0.4792. As expected, this value is a bit off from the correct value, p1,2 = 0.5.
10
Now suppose that DP2 variation has changed somehow (e.g. change of a
supplier) from U[0,1.5] to U[-1,1.6]. Following the same steps described
above, we can obtain p1,2, p1, and p2. It turns out that p1,2 = 0.499; p1 = 0.5;
p2 = 0.9654. Again, p1*p2 (= 0.4827) is slightly off from the correct value.
FR2
FR2
2.6
2
Joint p.d.f.
(FR1,FR2)
0.6
.6
-1
2.6
0.3846 p.d.f
FR1
-1
-1
Design range
-2
(a)
-2
(b)
p.d.f
0.5
-1
1
(c)
FR1
Figure 12. Joint p.d.f. of (FR1,FR2) and the marginal p.d.f.'s for FRs.
What is important here is that even though the probability of success by using
the joint p.d.f. shows a hint of performance degradation (p1,2 < p1,2) , the other
probability of success by using two marginal probabilities indicates the
opposite trend (p1*p2 > p1*p2). This can be a significant problem when
detecting mal-functioning is time-critical for recovering the system. Therefore,
as emphasized earlier, it is very important to consider the joint p.d.f. when
there are multiple functional requirements that are not completely uncoupled.
This section explained how to compute information contents for multiple-FR problem
using 2-FR uniform distribution examples. Applying the same technique to three or
more-FR problems with general distribution will not be effective. Indeed, when it is not
the simplest case, computing information contents is perhaps best handled by a
probabilistic simulation technique such as Monte Carlo simulation.
11
Chapter 4.
Design of Systems
Introduction
What is a system?
CMP machine
System
Nervous system
[Figures of spacecrafts
removed for copyright
reasons.]
Element
[Figures of human
biology removed for
copyright reasons.]
Eyeball
Subsystem
Individual parts
Cellular structure in
the retina
Component
:
Leaf
Definition of a System:
An assemblage of
sub-systems,
hardware and software components, and
people
designed to perform a set of tasks so as to
satisfy the specified FRs
and constraints.
Examples of Systems
Software
Machines
Manufacturing systems
Materials
Products
Government
Classification of Systems
Are all systems alike?
How should we classify systems?
Classification of Systems
Should the system be classified based on the
physical size of the system?
or
Should it be based on the number and nature of
the functions
that the system must perform?
Classification of Systems
Why does the classification of systems
based on functions
rather than physical size
make more sense?
Classification of Systems
Large systems from Small systems
Static systems from Dynamic systems
Fixed systems from Flexible systems
Passive systems from Active systems
Open systems from Closed systems
Definition of Module
FR1 a 0 DP1
FR2 b cDP2
Definition of Module --- Mi
FR1 = a DP1 = M1 * DP1
FR2 = b DP1 + c DP2 = M2 * DP2
where M2 = b (DP1 / DP2) + c.
Definition of Modules
FR1 = a DP1 = M1 * DP1
FR2 = b DP1 + c DP2 = M2 * DP2
Definition S1
(Equivalent Designs)
SAAB,
Developer of Defense Airplanes of Sweden
V-Model
System
Needs
Biological
System
Establish
Interfaces
Identify
Molecular
Entities
Decompose
hy
Define
Modules
In
te
gr
at
e
(B Ph
ot ys
to ica
m
-U l En
p)
tit
c
ar
er
Hi n)
P
-D ow
FR p-D
ild (To
Bu
Map to
DPs
ies
Determine
System
Morphology
Define
FRs
Map DPs to
Biological Entities
Figure1. V-model overview of system analysis using the Design Matrix. The V-Model
describes how the Design Matrix of AD is used to study hierarchical nature of biological
systems
NASA Requirements
(Level 1 & 2)
Customer
Needs
Identifies Lowest
Level Requirements
& Interactions
Define
FRs
Estimate the
Systems Physical
Solutions
Satisfy system
morphology
System changes
are assessed
Construct local
assemblies
Map to
DPs
Build FR -DP
hierarchy
(Top -down)
Establish
interfaces
Decompose
Define
Modules
Identify
physical
components
Detailed
system
Integrate
physical entities
(Bottom -up)
The V-Model
Customer
Attributes
Define FRs
Establish Interfaces
Mapping
ch
ar
ier h)
eh c
ar roa
ftw pp
so n A
the ow
ild - D
Bu (Top
y
CA Domain
Bu
ild
th
(B e o
ott
b
om ject
o
-U
p A rien
pp ted
ro
ac mod
h)
el
Software
Product
Identify classes
Decomposition
Module
Definition
Identify Leaves
(Full Design Matrix)
FR / DP Domain
DP / PV Domain
Theorem S7 (Infinite
Completeness)
Adaptability
versus
equivalent
ways
of
FR2 0
0 DP1
A22 DP2
FR11 X O DP11
=
FR12 X X DP12
FR21 X
FR22 = X
FR23 0
0
X
0
0 DP21
0 DP22
X DP23
FR121 X
FR122 = X
FR123 X
0
X
0
0 DP121
0 DP122
X DP123
FR1231 a 0DP1231
FR1232 b cDP1232
Modules
FR1231 = a DP1231 = M1231 * DP1231
FR1232 = b DP1231 + c DP1232 = M1232 * DP1232
where M1232 = b (DP1231 / DP1232) + c.
Summation Junction
Control Junction
M2
M21
M214
C
M213
M212
M22
S
M211
Hardware Module
Software Module
M23
S
M1
M12
M121
M122
M123
M11
M1232
M112
M12323
S
M111
M1231
M12322
M12321
VP chill
Adhesion promoter
Coating
Photoresist film
Soft Bake
SB chill
Solvent evaporation
Substrate
Developed image
(negative resist)
HB chill
Hard Bake
Developing
Chemical reaction
in exposed area
PEB chill
PEB
(Post Exposure
Bake)
Exposure
Stack o f mo dules
Trac k
Robo t
Loading
Station
Stack o f mo dules
Unloading
statio n
Cost
Footprint
Reliability
Safety
Serviceability
Manufacturability
Contamination
Minimization of wafer temperature variation
Parent FR : FR1 = coat wafers with desired resist film at desired throughput rate
Parent DP: DP1 = coating process modules
Constraints : Decomposition of DP1 must not affect FR2, FR4
FR11 = prepare wafer for coating X O O DP11 = thermal process module1
FR12 = coat the wafer with resist O X O DP12 = (N1) spin coater
FR13 = complete coating process O O X DP13 = thermal process module2
FR11
FR12
FR13
FR21
FR22
FR23
FR31
FR32
FR41
FR42
FR43
DP11
DP12
DP13
DP21
DP22
DP23
DP31
DP32
DP41
X
O
O
O1
O
O1
X
X3
O
O5
O*
O
X
O
O
O2
O
X
O4
O
O5
O*
O
O
X
O1
O
O1
X
X3
O
O5
O*
O1
O
O1
X
O
O
X
X3
O
O5
O*
O
O2
O
O
X
O
X
O4
O
O5
O*
O1
O
O1
O
O
X
X
X3
O
O5
O*
O
O
O
O6
O
O
X
X
O
O
O
O
O
O
O6
O
O
O
X
O
O
O
X
X
X
X
X
X
X
O
X
O
X
DP42 DP43
O
O
O
O
O
O
O
O
O
X
O
X
X
X
X
X
X
O
X
O
O
X
Notes :
1. Thermal effect must be considered among
thermal process modules - we can use some
kinds of thermal shields or we can do that
with appropriate layout.
2. Spin module must not affect each other in the
sense of vibration, particle generation, etc.
3. The evidence of this X is the utilization of
IBTA robot.
4. Standard method for wafer hand-off is required.
5. Flexible or standard way of supervising
(sensing)
6. There must be no delay from stepper to
thermal process module 3.
M1
M11
M12
M4
M41
M13
M43
M3
S
M42
M21
M22
M2
M23
M31
M32
M1
M11
M111
S
M112
M12
M121
M122
M127
M124
M123
M126
M125
M131
M13
S
M132
M2
M21
M211
S
M212
M22
M221
M222
M226
C
S
M223
M224
M126
M225
M23
M231
S
M232
Matrix rearrangement
FR1 X
FR 2 X
FR3 O
FR 4 O
O
X
X
X
O
X
X
X
O DP1
O DP 2
O DP3
X DP 4
DPa
DPb
2 0 2 2 0
FR1 2 1
DPc
FR 2 = 1 = 0.5 1 0 0 1 0
DPd
FR3 3 0.1 0.2 0 0 3 0.5
DPe
DPf
FR 2 2 0.5 0 0 DPa
FR1 = 1 = 1 2 0 DPd
FR3 3 0.1 0 0.5 DPf
DP 2 + = 2FR 2 + = 0.2
DP1+ = 0.5DP 2 + + 0.5FR1+ = 0.05
DP3 = 0.2DP 2 + 2FR3 = 0.16
DP1
0.2
0.19
0.16
0.05
0.1
-0.2
0.2
-0.1
DP2
0.1
-0.2
-0.1 -0.05
0.05
0.2
DP2
-0.05
-0.19
-0.2
DP1
DP3
0.2
Joint p.d.f. for (DP1,DP2)
0.16
0.1
0.1
0.1
-0.2
0.2
-0.1
DP2
0.1
-0.2
0.2
-0.1
DP2
-0.1
-0.1
-0.2
F
A
Robot
IN OUT
Part
Process module for X
X
Design a manufacturing
system
to eliminate the root cause
of a problem (symptom)
In/Out buffer
Photoresist processing
Vapor
Prime
VP chill
Adhesion promoter
Coating
Photoresist film
Soft Bake
SB chill
Solvent evaporation
Substrate
Developed image
(negative resist)
HB chill
Hard Bake
Developing
Chemical reaction
in exposed area
PEB chill
PEB
(Post Exposure
Bake)
Exposure
F
Robot
IN OUT
Part
In/Out buffer
Taesik Lee 2005
Process
Time (sec)
# of
modules
40
20
17
60
15
40
35
Level 1
FRs
#.1
#.2
DPs
Process modules
System configuration
FR1 X
FR2 =
X DP1
X DP2
Level 2
FRs
#.1
#.2
#.3
DPs
Recipe handling
module
System layout
Transport system
FR2.1 X
FR2.2 = O
FR2.3 X
O
X
O DP2.1
X DP2.2
X DP2.3
DPs
Number of each process
module
Number of IBTA
Layout (module
arrangement)
FR2.2.1 X
FR2.2.2 = O
FR2.2.3 X
O
X
O DP2.2.1
X DP2.2.2
X DP2.2.3
Coordinate transport
function
Move wafer from CES
to VP
From VP to VPC
From VPC to CT
M
From HB to HBC
From HBC to CES
DPs)
Command and control
algorithm
CES handler
IBTA
Central handler
M
Central handler
SI handler
DP1: robot 1
DP2: robot 2
t=0
t = t1
t = t2
FR = {FR1}
FR = {FR4}
FR = {FR2, FR3, FR5}
DP = {DP1}
DP = {DP2}
DP = {DP1, DP2}
Problem definition
Robot
SP
T1
P2
P1
SP
T2
T1
P1
SP
SP
P1
SP
T2
T1
In/Out buffer P3
P2
P1
T2
T1
P3
P2
T2
P3
Delay time
T1
P1
P3
P2
Conflict
P1
T3
T2
T1
P3
P2
IN OUT
Part
P1
P2
T2
T1
P2
P1
SP
P3
T2
P3
T1
P2
P1
SP
T3
T2
T1
P1
T3
P3
P2
T1
T2
P2
P3
T2
T3
P3
i 1
j =1
j =0
j =1
i 1
j =0
j =1
i = ti int(ti )
E
Process
D
C
B
A
IN
Conflict
0
0.5
1.5
Solution
Basic concept
Break the conflicts among number of transport requests from process
modules
Use predetermined queue as a decoupler between process and
transport
Insert optimum queue at possible process steps
i 1
j =1
j =0
j =1
j =1
Solution
Condition for no-conflict:
~ * * ~
tmax
1 tmax
i
j
Where
*
i j = i j +
k =1
qk
~
tmax : longest transport time
qk = i j +
k =1
(aik a jk ) qk'
k =1
min
q 'j
j =1
Solution
Process
Time (sec)
Delay (sec)
40
20
17
60
15
40
35
A
D
B
IN
0
0.5
1.5
28
7
3
19
10
Ford
10
1
Nissan
Honda
Models rated
above average
Toyota
10
Conclusion
1
KEY
Cost
1 = Handicraft
2 = Taylorism
3 = High Volume Automation
4 = Flexible Automation
5 = Concurrent Engineering
Worker's
satisfaction
The 50's
The 60's
The 70's
Efficiency of
manual labor
Efficiency of
machine-tool
utilization
Minimize capital
cost for products
in process
Order control
customer adapt
The 80's
Quality &
productivity
holistically
The 90's
Customer,
concurrent
design, lean
production,
environment
on
credit
for
NC
machine
tool
PRODUCT
DESIGN
PRODUCTION
PLANNING
PRODUCTION
CONTROL
PRODUCTION
EQUIPMENT
PRODUCTION
PROCESSES
FINISHED
PRODUCTS
for production
programming
feedback,
supervisory,
adaptive
optimizing
including
machine tools
removal,
forming,
consolidative
fully assembled,
inspected &
ready for use
PERFORMANCE
2.
Available technologies
3.
Performance measurements
4.
Competitive factors
2.
2.
3.
Corresponding DPs :
Push system
A conflict can arise
in scheduling the robot motion
if two processes are completed
within the time it takes
for robot to pick up and deliver a wafer
(i.e., single robot motion).
FR11 X X DP11
FR12 X X DP12
The original system was a coupled design.
FR11 X
=
FR12 X
0 DP11
X DP12
(6.1)
Push system
Number of modules
corresponding to T.
ni
needed
for
each
i
i
( 6 .2 )
ni = Int = Int
3,600
T
where
T= Cycle time
M = No. of wafers per hour
process
Push system
Total number of modules, n, required to process the
wafers:
N
n = ni
i =1
where
N is the number of tasks, i.e., processes.
(6.3)
Push system
Decompose FR12 (Transport the wafers) as
Push system
Design equation
FR121 X 0
=
FR122 X X
DP121
DP122
(6.4)
Push system
Total process time Tc
T C = t P + tT +
where
tP is the total process time
tT is the total transport time.
i =1
qi
Push system
To minimize TC, we must satisfy the following two
conditions:
TC
qi = 0
i =1
N
2 TC
> 0
2
i =1 qi
N
( 6.5)
Push system
Analytical Solution for Queues in Decouplers
Push system
Ti = Time the wafer has to be picked up upon the
completion of process j in Module i
Ti =tP +tT
(6.6)
where
tP = total process time up to and including the i-th module
tT = accumulated transport time up to i-1 (normalized
times)
Push system
Ti (Time the wafer has to be picked up upon the
completion of process j in Module i), may be written as
i
i1
(6.7)
j=1
Push System
nR = number of pick-up moves the robot can make
in a given period T
T
nR =
tT
(6.8)
Push System
Time i
-- measured from the beginning of each period -at which the robot has to pick up a wafer
i1
i1
i1
i
i
i
(6.9)
where Int(x) is a function that rounds x down to the next nearest integer.
Push System
T T1 = q1
*
1
T2 T2 = q1 + q 2
*
T T3 = q1 + q 2 + q 3
*
3
etc.
Push System
i = qj = aijqj
*
i
j=1
when i > j
when i < j
(6.11)
Push System
We can approximately determine i* by solving Eq. (6.9), by determining
where the decouplers may be needed, and by approximating the values of
queues.
[ ]{}
{i i}= aij qj
(6.12)
Push System
1
{q}= [a] {} = [A]{} = [A]{}
aij
1
where
= i i *
[ A] = Adj [aij ]= [A ji ]
A ji = ( 1)
i+j
M ji minor
M ji
of a ji
i =1
(6.13)
Equation (6.13) can be solved iteratively. To solve Eq. (6.13), we need to know {},
which can be approximated by estimating reasonable values for i* and by solving Eq. (6.9)
for i. The value for j* can be estimated by adding transport time to i*, since |i*- j*|> tT,
for all j's except j=i. The solution can be improved by successive substitution of the
improved values of i*. The determinant |aij| of the triangular matrix {a} is equal to the
product of the diagonal elements.
Since the best solution is the one that makes the total cycle time TC a minimum, we must
seek for a set of values of qi that yield a minimum value for the total queue, qi. When the
precise control of processing time is critical, the queue qi associated with the process should
be set to equal to zero.
To solve Eq. (6.12) for the best set of queues q's, Oh (1998) and Oh and Lee (1999)
developed an optimization software program based on genetic algorithm. Multiplying these
qs by T, we can obtain actual values of queues.
Steps
1
2
3
4
5
35
80
10
50
68
50 + 25
45 +/- 0
60 + 20
70 +10
35 +/- 0
Solution
The number of modules is dependent on the process time TC and the desired
throughput rate. The required number of modules is as follows:
Modules
A
B
C
D
E
Number of Modules
2
1
2
2
1
Without any decouplers, there are simultaneous demands for the service of the
robot as shown in Fig. ex.6.1.a, which shows the time the process is finished in
each of the modules within a given period T.
Process
D
C
B
conflicts
A
IN
0
0.2
0.4
0.6
0.8
1.2
1.4
1.6
1.8
The original pick-up time without any decouplers. There are conflicts
among the transport demands from Modules A, B, C, E, and IN, since it
takes the robot 0.1 normalized time to travel between the modules.
Push Systetm
Solution for qs
The best solution was obtained by finding a set of values that give the shortest cycle time
TC solving Eq. (6.12) repeatedly and using a genetic algorithm. The solution yields the
following values for q's.
qA = 19.7 sec
qB = 0 sec
qC = 9.3 sec
qD= 9.3 sec
qE = 0 sec
The queues for B and E zeros since the tolerance on these two modules is specified to be
zero. Therefore, the queues of other modules has been adjusted to make these two queues
to be zero.
0.2
0.4
0.6
0.8
1.2
1.4
1.6
1.8
The actual pick-up time for Modules A, B, C, D, and E. A set of queues, qA=19.7,
qB=0, qC=9.3, qD=9.3, and qE=0, are added to the original process times to resolve
the transport conflicts. It takes the robot 0.1 normalized time to travel between the
modules. Oh (1998) and Oh and Lee (2000).
Push System
Chapter 6
Design of Manufacturing Systems II
Pull System
Cost
1 = Handicraft
2 = Taylorism
3 = High Volume Automation
4 = Flexible Automation
5 = Concurrent Engineering
Worker's
satisfaction
The 50's
The 60's
The 70's
Efficiency of
manual labor
Efficiency of
machine-tool
utilization
Minimize capital
cost for products
in process
Order control
customer adapt
The 80's
Quality &
productivity
holistically
The 90's
Customer,
concurrent
design, lean
production,
environment
NEEDS
(product requirements)
CREATIVITY
(product concepts)
COST AND CAPABILITIES
PRODUCT
DESIGN
PRODUCTION
PLANNING
PRODUCTION
CONTROL
PRODUCTION
EQUIPMENT
PRODUCTION
PROCESSES
FINISHED
PRODUCTS
for production
programming
feedback,
supervisory,
adaptive
optimizing
including
machine tools
removal,
forming,
consolidative
fully assembled,
inspected &
ready for use
PERFORMANCE
a Pull System
Step 1. Choose FRs in the Functional
Domain
FR1 = Maximize the return on
investment (ROI)
SalesCost
ROI=
Investment
Sales Cost
ROI =
Investment
(2)
DP1 3
(4)
FR111 X0 DP111
=
FR112 XXDP112
(6)
FR111 X0 DP111
=
FR112 XXDP112
Design Matrix
FR121 X00 DP121
FR122 = 0X 0 DP122
FR123 00X DP123
FR 133
FR 134
X 000 DP 131
XX 00 DP 132
=
00 X 0 DP 133
DP 134
000
X
FR 1111
FR 1112
FR 1113 =
FR 1114
FR 1115
X 0000
XX 000
0 XX 00
0 XXX 0
0 X 00 X
DP 1111
DP 1112
DP 1113
DP 1114
DP 1115
FR1121 X0 DP1121
DP1122
FR1122
XX
(10)
(12)
Crack detect
Buff OD rack
Super finish OD
Assemble pistons
Lap journal
10
Broach teeth
2
1
IN
Wash
Centerless grinder
3
Final wash
(rust prevent)
OUT
Induction temper
11
Straighten
Scan harden journal
Deburr
Turn piston groves
Drill cross holes
Broach end slots
Machine both
ends
Figure by MIT OCW.
(14)
(15)
FR111311
X 0 DP 11131
FR111312
XX
DP
11132
(16)
(17)
This design is a decoupled design and thus, satisfies the Independence Axiom.
FR111331 X 0 DP111331
= X X
FR111332
DP111332
(18)
This design is a decoupled design and thus, satisfies the Independence Axiom.
FR111421
FR111422
FR111423 =
FR111424
X
X
X
0
X
0
0
X
0 DP111421
0 DP111422
0 DP111423
X
DP111424
(19)
FR 1113121 X
FR1113122 = X
FR 1113123 X
0
X
X
0 DP 1113121
0 DP 1113122
X DP 1113123
(20)
M 111
M 112
M 1111
M 1121
M 1112
M 11121
M 11123
M 1 1122
M 1113
M 11131
M 111311
M 11133
M 111312
M 111331
M 1113122
M 1113121
M 111332
M 1113123
M 11132
M 111321
M 111323
M 111322
M 1114
M 11141
M 11142
M 11143
M 111421
M 111422
<111423
M 111424
M 1115
M 12
M 13
M 121
M 131
M 122
M 133
M 1221
M 134
M 1222
M 1223
M 12231
M 1224
M 1225
S um m ation J uncti on
C ontrol Junction
M 123
M 12232
M 12233
M 132
M 1122
Diagnosis
2.
Engineering changes
3.
4.
Distributed systems
5.
Software development
Complexity
Reference:
Nam P. Suh, Complexity: Theory and Applications,
Oxford University Press, 2005
Why complexity?
In many fields (engineering, economics, politics, academic
administration, etc.), one of the major goals is to reduce
complexity.
In many fields, we want to understand the causes for
complexity.
There is a great deal of confusion what we mean by
complexity.
Computer scientists and mathematicians have considered
complexity, which may not be applicable to design and
engineering fields.
(David P. Feldman and Jim Crutchfield, A Survey of Complexity Measures, 1998 Complex Systems Summer School,
Santa Fe Institute, 11 June 1998.
What is complexity?
Computational complexity
Algorithmic complexity
Probabilistic complexity
"What we
wa nt to
ac hieve or
kn ow"
"H ow w e
plan to
ac hieve
the goa l"
{FR s}
{DP s}
Design
range
FR
System
Range
Functional
Requirement
Design
Range
System
Range
Functional
Requirement
Definition of Complexity
Definition of Complexity
Complexity,
which is defined as a measure of uncertainty
in satisfying the FRs,
is a relative quantity.
Functional Periodicity
Temporal periodicity
Geometric periodicity
Biological periodicity
Manufacturing process periodicity
Chemical periodicity
Thermal periodicity
Information process periodicity
Electrical periodicity
Circadian periodicity
Material periodicity
Design
Range
System
Range
Functional
Requirement
Pro b. De n s ity
De si g n
Ra n ge
De si g n
Ra n g e
Syste m
Ra n ge
Sy ste m
Ra n g e
FR1
FR2
Axiomatic design:
Mapping, hierarchies, and zigzagging
Customer
Domain
Functional
Domain
What?
Physical
Domain
How ?
What?
Customer Needs
Functional
Requirements
Process
Domain
Design
Parameters
How ?
Process Variables
Design Axioms
Axiom 1 The Independence Axiom
Maintain the independence of functional
requirements.
Axiom 2 The Information Axiom
Minimize the information content.
Aij = FRi/DPi
0
0
A33
Decoupled Design
0
A11 0
[A] = A21 A22 0
A31 A32 A33
Coupled Design
Probab.
Density
Target
Bias
System
Rang e
Design Rang e
Area o f
Com mon
Rang e (Ac)
Variation
from the
peak valu e
FR
FR
A22
2
= 0
FR3 0
0
FR1
DP1 =
A11
FR2
DP2 =
A22
FR3
DP3 =
A33
Decoupled
0 DP1
0 DP 2
A33 DP3
FR1 A11 0
FR
2
= A12 A22
FR3 A13 A23
DP1 =
DP 2 =
DP3 =
0 DP1
0 DP 2
A33 DP3
FR1
A11
FR 2 A21 DP1
A22
FR3 A31 DP1 A32 DP 2
A33
M ill ed Fl a t
En d o f th e
s h af t
Me ta l
S h af t
S lot
I n jec tio n
m o ld ed
n ylo n K n o b
Knob designs
M ill ed Flat En d
o f th e sha ft
Slot
Me tal
Sh af t
A
Injec tio n
m old ed
nylo n K n ob
(b)
(a)
Se cti on view A A
Knob designs
Conventional Engine
A New Engine
New Engine
New Engine
System
Range
Functional
Requirement
Original
image
Image is
created
Seleniumcoated
Aluminum
cylinder
PaperFeed
Roll
Paper
Wiper
Roll
Toner
container
Toner is coated
on surfaces of
Selenium with
electric charges
FR2 = XX0DP2
FR3 XXXDP3
CI = - log2 P = log2 n!
n
1
2
3
4
5
6
7
8
n!
1
2
3
24
120
720
5,040
40,320
p = 1/ n!
1
0.5
0.1667
0.04167
0.8333 x 10-2
0.1389 x 10-2
0.1984 x 10-3
0.2480 x 10--4
System
Range
Functional
Requirement
Fabricated machine
CMP machine
2 platen, single head (200 mm)/Multi-step wafer polishing.
Developed at MIT to meet the research needs.
9 servo motors/4 pumps/8 pressure regulators/60 on-off controllers.
Control hardware
Servo Amplifiers
Master Switches
Encoder Filter
ADwin Controller
DC Distribution Panel
Servo Amplifiers & DC Supplies in the Back Panel
AC Switch Panel
Time-Dependent Combinatorial
Complexity
Time-dependent combinatorial complexity
arises because the future events occur in
unpredictable ways and thus cannot be
predicted.
For example, it occurs when the system
range moves away from the design range
as a function of time.
Pro b. D en sity
T h e Sy st e m Ra n g e c han ge s
con tin u ou sly a s a f u nc tion of ti me.
D es ign
Ran ge
T im e
FR
Example
Airline Schedule
Transform
a design with time-dependent combinatorial
complexity
to
a design with time-dependent periodic
complexity
4.
6.
5.
"Reinitialization"
Set the beginning of the cycle as t=0
Functional Periodicity
(4)
Complexity - II
A Manufacturing System
Composed of Two Sub-Systems
Stack of modules
Stack of modules
Track
Robot
Loading
Station
Stack of modules
Subsystem A
Stack of modules
Subsystem B
Subsystem X
IN
Process
a
Process
b
Subsystem
Y
Process
d
Process
c
c
b
8
7
a
9
10
IN
M a c h in e
M a c h in e
M a c h in e
M a c h in e
M a c h in e
10
15
20
25
30
35
40
45
50
55
60
65
70
75
80
85
10
15
20
25
30
35
40
45
50
55
60
65
70
75
a
b
c
d2
ro b o t
M a c h in e
M a c h in e
M a c h in e
M a c h in e
M a c h in e
ro b o t
15
20
25
30
35
40
45
50
55
60
65
70
75
80
10
15
20
25
30
35
40
45
50
55
60
65
70
7
3
10
a
b
c
d1
ID L E
d2
7
10
The same approach as in case 2, with the no-transporttime adjusted, applies to case 3.
Functional Periodicity
(2)
Geometric periodicity
Friction Space
Constraint:
No lubricant
FR1 X 0 0 0 DP1 X 0 0 0 A
FR2 0 X x 0 DP2 0 X x 0 R
=
=
FR3 0 0 X 0 DP3 0 0 X 0
FR4 0 0 0 X DP4 0 0 0 X V
Pin-Joint Design
Electrical Connectors
(Courtesy of Teradyne, Inc.)
Male connector
Compliant pin
(for permanent connection)
Plastic
overmolding
Plastic
overmolding
Female connector
Design Matrix
FR1 X 00 DP1
FR2 = XX 0 DP2
FR3 0XX DP3
Functional Periodicity
Temporal periodicity
Geometric periodicity
Biological periodicity
Manufacturing process periodicity
Chemical periodicity
Thermal periodicity
Information process periodicity
Electrical periodicity
Circadian periodicity
(10) Material
periodicity
k1 = 22 c
dc
k1
= A
dN
Y
Onset of plastic
instability
Force
Workhardening
region
Yield
point
Fracture
Elongation
S tr a in
D islo c at io n d e nsi ty
S tr a in
D islo c at io n d e nsi ty
A nn ea lin g
S tr a in
Complexity Theory
and
the Stability of a System
For a system to be stable and survive for a long
period of time, it must either
Be at equilibrium
or
Have a functional periodicity
Examples in Nature
Temporal periodicity
Geometric periodicity
Crystalline solids,
Biological periodicity
Manufacturing processing
periodicity
Biological systems
Scheduling a clustered
manufacturing system,
Chemical periodicity
Polymers
Thermal periodicity
Temperature of Earth,
Language
Re-initialization of software
systems, music
Electrical periodicity
Thunder storm
Circadian periodicity
Living beings,
Material periodicity
S ta b ili ty
E q uilib rium
F un ct ion a l
Pe ri o di city
Functional Periodicity
Case Studies
Economic development of ROK (1980-85)
National Science Foundation
Mechanical Engineering Department of MIT
Functional Periodicity
(3)
Biological periodicity
Systems Biology
The goal is to relate the higher-level FRs to the
behavior of biological molecules.
Use the knowledge in curing patients.
Use the knowledge in drug discovery.
Systems Biology
Based on the complexity theory, one may speculate that
biological systems must have a functional periodicity.
Based on axiomatic design theory and complexity
theory, one may speculate that most biological systems
are a decoupled or uncoupled systems.
How do we relate the molecular behavior to the
behavior of biological systems?
FRs of a Cell
FR1 = Isolate the cell and its components from its
environment.
FR2 = Obtain fuel.
FR3 = Convert the fuel to energy.
FR4 = Communicate with it surrounding.
FR5 = Reproduce itself.
FR6 = Control cell functions.
DPs of a Cell
DP1 = Plasma membrane (phospholipid bilayer)
DP2 = Diffusion of ions and transport of proteins
DP3 = Synthesis of ATP in mitochondria
DP4 = Receptors and signal
transduction protein
DP5 = Reproduction mechanism
DP6 = Functional periodicity
X
X
0
X
x
FR61 x
FR62 0
FR63 X
0
X
X
x
X
0
0
X
0
0
X
0
X
0
0
X
0
0
0
X
x
0
0
X
0
0
0
0
X
0
0
0
DP6
DP61 DP62
0
0
0
0
0
0
0
0
0
0
X
0
0
X
0
X
DP63
0
0
0
0
X
0
0
X
FR51
FR52
FR53
FR54
FR55
FR56
FR57
DP51
X
X
X
X
X
X
0
DP52
0
X
0
0
0
0
0
DP53
0
0
X
0
0
0
0
DP54
0
0
0
X
0
0
0
DP55
0
0
0
0
X
0
X
DP56
0
0
0
0
0
X
X
DP57
0
0
0
0
0
0
X
DP572
DP573
DP574
DP575
DP576
FR571
FR572
FR573
FR574
FR575
FR576
Conclusions
The field of complexity may be a new emerging field in
science and technology.
The complexity presented in this talk provides a 40,000
feet view of the engineering systems and natural
systems.
It provides guidelines what to do and what not to do.
Conclusions
Complexity must be defined in the functional
domain, not in the physical domain.
There are the following four types of complexity:
Conclusions
Conclusions
2.882
Complexity
Complexity in AD
Complexity
Complexity
Measure of uncertainty in achieving FR
Does uncertainty
change with time?
Time-independent
Complexity
Real
Imaginary
complexity complexity
Time-dependent
Complexity
Combinatorial
complexity
Taesik Lee 2005
Periodic
complexity
of FRs of a system
ui =
0 (failure)
1-P(FRi = success)
Information content:
|dr|
Design Range
Common
Range,
AC
System Range,
p.d.f. f(FR)
I(p) [bit]
p.d.f.
f(FR)
5
4
3
2
1
0
drl
dru
FR
0.2
0.4
0.6
0.8
P(FRi =success)
|sr|
Taesik Lee 2005
Time-dependent complexity
Time-dependency
Complexity Uncertainty in achieving a set of FR
Complexity is time-dependent if
2) behavior of FR is time-dependent
FR = FR(t)
Time-independent
Time-dependent complexity
Combinatorial complexity
Periodic complexity
by re-initialization
Taesik Lee 2005
Metal
shaft
Slot
A
Injection molded
nylon Knob
(a)
(a)
(b)
(b)
Section view AA
initialization
S. T. Oktay and N. P. Suh, Wear debris formation and agglomeration, Journal of Tribology, 1992
Subsystem X
Subsystem Y
Problem description
Subsys
X
Station
PTi or CTY
(sec)
Number of
machines
MvPki
(sec)
MvPli
(sec)
IN
30
40
50
80
605
1
1
1
2
1
5
5
5
5
-
5
5
5
5
5
a
b
c
d
IN
Fastest speed *
70 seconds when X determines the
system speed
65-75 seconds when Y determines
the system speed
Inter
face
Subsystem Y
Objective
Maximum utilization rate for the machine Y
Constraint
Transport from C to D must be immediate
6th part
ready at X
5th part
ready at X
4th part
ready at X
3rd part
ready at X
FPX
1st part
ready at X
2 FPX
2nd part
ready at X
3 FPX
4 FPX
Time, t
Y process
starts
5th demand
from Y
D5
z4
z3
1st demand
from Y
Y process
strats
z2
z6
FPY,5
FPY,4
6th part
ready at X
FPY,3
5th part
ready at X
FPY,2
4th part
ready at X
FPY,1
3rd part
ready at X
FPX
1st part
ready at X
2 FPX
2nd part
ready at X
3 FPX
4 FPX
Time, t
Y FINISH
Y START
Y FINISH
CT Y = 60 sec
1 2
Transport
(next period)
Y START
Max[ CT Y ] = 6 5 sec
Machine d1
1 2
Min[ CT Y ] = 55 sec
Machine c
Machine d2
3 4
Machine b
Machine a
5 6
6
Machine c
7 8
SP=70sec
3 4
4
Machine b
9 10
Machine d1
5 6
Machine a
Machine c
7 8
SP=70sec
Machine b
9 10 Machine a
New panel
New panel
Y FINISH
Max[CT ] = 6 5 sec
Y START
Panel #
2
Machine d1
Y FINISH
Y START
Max[CT ] = 65 sec
Machine d2
Machine c
7
Machine b
SP = 95 sec
Machine d1
5
3
9 10
X X X X
No Transport
9 10
Machine c
Machine a
New panel
Machine b
X X X X
9 10
9 10
SP = 75 sec
Figure 11 (b)
Y FINISH
Max[ CT ] = 6 5 sec
Y START
Panel #
Machine d1
5
Y FINISH
Y START
Max[ CT ] = 6 5 sec
Machine d2
5
Machine a
Machine c
7
Machine d1
Machine b
9 10
X X
SP = 90 sec
5
9 10
6
Machine a
Machine c
7
8
X X X X
No Transport
New panel
Figure 11 (c)
From Lee, Taesik. "Complexity Theory in Axiomatic Design." MIT PhD Thesis, 2003.
Taesik Lee 2005
From Lee, Taesik. "Complexity Theory in Axiomatic Design." MIT PhD Thesis, 2003.
Taesik Lee 2005
u(T)
= {1, 1, , 1, 1, 1, , 1}
tini = trequest
if trequest 70 sec ( FPX )
tini = 70sec
3rd demand
from Y
2nd demand
from Y
1st demand
from Y
Y process
strats
Y process
strats
FPY,1
Y process
strats
FPY,2
5th demand
from Y
Y
4th
process
demand
starts
from Y
Y process
starts
D5
D4
FPY,3
t4
t3
t5
5th part
ready at X
4th part
ready at X
t1
Time, t
z1
z2
2nd part
ready at X
3rd part
ready at X
z6
Conclusion
* Figure taken from Molecular Biology of the Cell, Alberts, Garland Science
centrosomes
Centrosomal abnormalities
Chromosome missegregation
Aneuploidy
Functional periodicity
Machine
X
IN
Inter
face
Machine Y
Mechanism
G1Cdk
Cdk2 (S-Cdk)
promote
accumulation
Mitogen-dependent
mechanism
(Extracellular signal)
inactivate
Rb
inactivate
inactivate
G1/Scyclin
G1/SCdk
E2F
Firing origin of
replication
Centriole
split
Replicating DNA
Duplicate
centrosome
DNA replication
checkpoint ensures
completion of
chromosome
duplication
S-cyclin
S-Cdk
inactivate
Check for
completion
Prophase
Prometaphase
Metaphase
Check for
spindle
attachment
Anaphase
Telophase
Hct1
APC
mutually
inhibits
Centrosome
duplication
Chromosome
duplication
gene
transcription
mutually
inhibits
Cytokinesis
mutually
inhibits
CKI:p27
Conclusion
Time-dependent FR
Functional periodicity
T1
(a) Periodic
T2
u5
u4
u3
u2
u1
u0
FR State
u5
u4
u3
u2
u1
u0
FR State
FR State
Periodic There exist Ti s.t. u(Ti ) = u(Tj) with regular transition pattern
Semi-periodic There exist Ti s.t. u(Ti) = u(Tj) without regular transition
pattern
T1
(b) Semi-periodic
T2
u5
5
u4
4
u3
3
u2
2
u1
1
u0
t
(c) Aperiodic
Predictability of FR
(Periodicity) (Predictability)
(Unpredictability) (Aperiodicity)
~ (Aperiodicity) ~ (Unpredictability)
Reference:
Chapter 7 of
Nam P. Suh, Complexity: Theory and Applications,
Oxford University Press, 2005
Definition of Complexity
Functional Periodicity
Temporal periodicity
Geometric periodicity
Biological periodicity
Manufacturing process periodicity
Chemical periodicity
Thermal periodicity
Information process periodicity
Electrical periodicity
Circadian periodicity
Material periodicity
Time-Dependent Combinatorial
Complexity
Time-dependent combinatorial complexity
arises because the future events occur in
unpredictable ways and thus cannot be
predicted.
For example, it occurs when the system
range moves away from the design range
as a function of time.
Prob. Density
D es ign
Ran ge
T im e
FR
4.
6.
5.
"Reinitialization"
Set the beginning of the cycle as t=0
Functional Periodicity
(2)
Geometric periodicity
i
Distance slid
(a)
Distance slid
(b)
s
I
Wear particles removed
i
Distance slid
Friction Space
Constraint:
No lubricant
FR1 X 0 0 0 DP1 X 0 0 0 A
FR2 0 X x 0 DP2 0 X x 0 R
=
=
FR3 0 0 X 0 DP3 0 0 X 0
FR4 0 0 0 X DP4 0 0 0 X V
Cause?
Plowing
FR 1 X 000 DP 1
FR 2 0 Xxx DP 2
=
FR 3 00 Xx DP 3
FR 4 000 X DP 4
FR 31 X 0 DP 31
FR 32 xX DP 32
FR 311 X 00 DP 311
FR 312 = xX 0 DP 312
00
X
DP
313
FR
313
FR 2 0 XxxxX 00 DP 2
FR 311 00 X 00000 DP 311
FR 41 000000 X 0 DP 41
FR 42 00000 X 0 X DP 42
Pin-Joint Design
Electrical Connectors
Male connector
Compliant pin
(for permanent connection)
Plastic
overmolding
Plastic
overmolding
Female connector
Design Matrix
FR1 X 00 DP1
FR2 = XX 0 DP2
FR3 0XX DP3
Tribotek, Inc.
Busbar Application Embedded
Configuration
Features
LowR 125 socket
Press-Fit into busbar
130 A
Benefits
Highest current
density
Low insertion force
Low contact
resistance, min voltage
drop
Available in various
contact sizes
Tribotek, Inc.
Busbar Application - Mounted Configuration
Features
LowR 125 socket
Press-Fit onto busbar
130 A
Benefits
Highest current density
Low insertion force
Low contact resistance,
min voltage drop
Available in various
contact sizes
2.882
Chapter 8 of Complexity
Reduction of Complexity in Materials through
Functional Periodicity
Engineered Materials
Functional Periodicity to to prevent unstable
crack growth
Wire rope
Fabric
Composites
Crack Growth
Unstable crack growth
k1 = 22
Crack Growth
Fatigue crack growth under cyclic loading
n
k
dc
= A 1
dN
Y
Composites
Stress-Strain Relationship
showing work-hardening
Wire Drawing
Microcellular Plastics
(Distortion of injection molded parts)
XX0 DP1
0 X0 DP2
00X DP3
Morphology of MuCell
Polystyrene Products
PP Products
PVC profiles
Injection Molding of
Microcellular Plastics vs Solid Plastics
TRW -- Air bag Canister (Material: 33% glass filled Nylon)
Solid
365 gms
45 sec
150 tons
Part weight
Cycle time
Tonnage
MuCell
252 gms
35 sec
15 tons
% red.
31%
22%
90%
S = S(p, T)
The change in the solubility can be expressed as:
S
S
S =
p +
T
p
T
Microcellular Plastics
by Batch Process
(From Cha, Ph.D.Thesis, MIT)
Microcellular Plastics
by Batch Process
(From Cha, Ph.D.Thesis, MIT)
Polymers
Microcellular Plastics
- Design of a Continuous Process
To create a continuous process, we must be able
to design a process and associated equipment
to perform following four functions:
(1) Rapid dissolution of gas into molten, flowing
polymer to form a solution,
(2) Nucleation of a large number of cells,
(3) Control of the cell size, and
(4) Control of the geometry of the final product.
Microcellular Plastics
- Design of a Continuous Process
Extruder
(1) Rapid dissolution of gas into molten, flowing
polymer to form a solution,
Die/Mold
(2) Nucleation of a large number of cells,
(3) Control of the cell size, and
(4) Control of the geometry of the final product.
D of CO2 (cm2/s)
At 188 C
At 200 C
-1.3x10-5
4.2x10-5
--2.6x10-6
5.7x10-5
2.4x10-5
-1.1x10-4
-7.0x10-6
-3.8x10-5
D of N2 (cm2/s)
At 188 C
At 200 C
-1.5x10-5
3.5x10-5
--8.8x10-7
6.0x10-5
2.5x10-5
-1.5x10-4
-8.3x10-6
-4.3x10-5
PE
14
PP
11
PS
11
PMMA
13
Table 7.3
Nucleation of Cells
Nucleation rate
dN
16
RT
= J = N0 f exp
3
3kT
Pg
dt
*
Pg A zU(1 2) + kT ln(
) + RT ln
1
P
Nucleation Theory
Nucleation rate:
dN
[G G *(gas concentration)]
= N 0 exp
dt
kT
G = Activation energy barrier
Solid/polymer interface
Non-polar polymer/polar
polymer interface
High strain region
Free volume
Crystalline/amorphous
interface in a polymer
Interface between crystallites
Morphological defects in a
polymer
Polar groups of polymers
--109 /cc
1012/cc
1018 /cc
---
1022 /cc
pdG
f of G
A ctiv ati on
Ene rgy Leve l
pd f of
(G-G*)
GG*
Effe ct of gas
on pdf of G
pd f of
G
G
Energy
Level
(N0)min
%gas
dissolved
How do we achieve
the simultaneous nucleation
of an extremely large number of cells?
Answer #1:
By creating a large driving force that can
easily overcome all activation energy
barriers for nucleation
How do we achieve
the simultaneous nucleation
of an extremely large number of cells?
Answer #2:
By making sure that the nucleation
rate is faster than the diffusion rate.
Nucleation Theory
Condition for Simultaneous Nucleation:
(From Baldwin, Ph.D.Thesis, MIT)
dN
dc
dt
<< 1
Nucleation Theory
Condition for Simultaneous Nucleation:
(From Baldwin, Ph.D.Thesis, MIT)
2 c1/ 3 ( tD )1 / 2 << 1
How do we achieve
the simultaneous nucleation
of an extremely large number of cells?
Answers:
1. By creating a large driving force
2. By making sure that the nucleation
rate is faster than the diffusion rate.
Time
D of CO2 (cm2/s)
@ 188
@ 200 C
-1.3x10-5
-2.6x10-6
5.7x10-5 2.4x10-5
-1.1x10-4
-7.0x10-6
-3.8x10-5
4.2x10-5 --
D of N2 (cm2/s)
@ 188 C @ 200 C
-1.5x10-5
-8.8x10-7
6.0x10-5 2.5x10-5
-1.5x10-4
-8.3x10-6
-4.3x10-5
3.5x10-5 --
C o n ce n trati on of
D i ss o l v e d G as
-3
CELL DENSITY, cm
1010
10 9
10 8
10 7
10 6
0
500
1000
1500
2000
2500
CELL DENSITY(*10 ), Cm
-3
35
30
25
20
15
10
5
0
0
d
R
dR
2
cell
cell
cell + Rcell
=
-4
+ Pg P
2
dt
Rcell dt
2 dt
Rcell
P
R
g cell
2 c
| Rcell
= 3 p Dr
t RT
r
dRcell
c Rcell dt c 1 2 c
+
= 2 r D
2
t
r
r r r
r
2
Initial condition
c(r, 0) = c i
Boundary conditions
c(Rcell ,t) = Ks P
c
=0
t t, r
f ( p, Tgas , r )
=1
g( Texterior layer , T r
, )
exterior layer
=1
g( Geomtry )
=1
>1
f (Vinjection )
g( , T polymer , c total gas , gas in
>1
polymer
Di e
P0
Pi
L
(Len gt h o f
th e Die Lip )
Cen ter
Lin e
Cell density = X X 0 dp dt
x
0
X
Geometry
Die
&
Acc.
Pi
X x 0
dp dt
= XX 0 L
Nu cl.
Ra te
0.5
X/L
Ce ll
Ra diu s
0.5
X/L
Viscosity
% Gas
D i ss o l v e d
Viscosity(Ns/m )
1000
800
600
No gas
400
0.5% CO2
200
0
0
1000
2000
3000
Shear Rate(1/s)
4000
5000
Santoprene @ 340F
Santoprene @ 340F
Viscosity(Ns/m )
200
150
No gas
100
1.5% CO2
50
0
0
5000
10000 15000
Shear Rate(1/s)
20000 25000
ABS @ 370F
ABS @ 370F
Viscosity(Ns/m )
600
500
No gas
400
3% CO2
300
8% CO2
200
12% CO2
100
0
0
10000
20000
30000
Shear Rate(1/s)
40000
= {(1 ) ln(1 ) + ln }
Tg = Tgo exp (M p )
1/ 3
()
1/ 4
Experimental results of Tg of
PETG
Microcellular Foaming/Forming
Experimental
- Cha-Yoon model indicates when the weight fraction of
CO2 dissolved in PETG is 7.7% the Tgis lowered to room
temperature
Photographs of two cups
made through microcellular
foaming/forming experiment
at room temperature
Hold
Cooling
Solid
Hold
Cooling
MuCell
Hold & Pack
is eliminated
25% less
cooling time
Printer Chassis
Printer Chassis:
35% Glass/Mineral filled
PPO/HIPS
8% weight reduction
Drop Weight Impact
Solid
6.7 ft-lb
7.3 kJ/m2
8% Wt. Red.
9.0 ft-lb
9.7 kJ/m2
Automobiles
Shipbuilding
Machine tools
Power plants and machinery
Earthmoving equipment
Small businesses
Research infrastructure
Automobiles
Shipbuilding
Machine tools
Power plants and machinery
Earthmoving equipment
Small businesses
Research infrastructure
Problem Definition
A wrong set of FRs.
Even for the right FRs, there was timedependent combinatorial complexity
problem.
Not enough fund for engineering research
and education.
Entrenched PVs.
Greater presence of engineering in Federal
Government
Vicious cycle for universities and funding
agencies
New (1985)
NSF Engineering Directorate Structure
Bio-Instrumentation
Engineering systems (manufacturing systems)
MEMS and nanotechnology
Energy
I mp ac t
of
R e se a r ch
Bas ic ( F u nda me n ta l )
R e se a r ch
R e s ear c h Sp ec tr u m
T e ch no logy
I n nova ti on
MIT
MIT
USS Peleliu
Freiman Curve
20
1 = Underestimates lead to
disaster
2 = Realistic estimates
minimize final costs
10
3 = Overestimates become
self-fulfilling prophecies
1
10
20
0
0
Estimated Cost
MIT
Figure by MIT OCW. Adapted from Freiman, F. R. The Fast Cost Estimating Models. AACE Transactions (1983).
Fail to address:
We need
Systematic approach
Better utilization of cost
data
MIT
TRACEABILITY
Approaches
Develop a general method for integrating cost information
into the system architecture
Development, Production, Operation phase
MIT
Value
Cost Credibility
Credibility
Completeness, Visibility
Traceability
MIT
NASA Requirements
(Level 1 & 2)
Customer
Needs
Identifies Lowest
Level Requirements
& Interactions
Define
FRs
Estimate the
Systems Physical
Solutions
Detailed
system
Satisfy system
morphology
System changes
are assessed
Construct local
assemblies
Map to
DPs
Establish
interfaces
Build FR -DP
hierarchy
(Top -down)
Decompose
Define
Modules
Identify
physical
components
Integrate
physical entities
(Bottom -up)
% completion
(hr)
Adjusted Cost
Baseline Cost
50%
Task
Model
FR111
FR112
FR121
FR122
DP111
DP112
DP121
DP122
CU2, $
FR1111
DP1111
DP1112
DP1211
CU21, $
CU22, $
DP1212
Comment
MIT
Affected Design
Parameters Identified
Installation
Test
Fabrication
Tooling
Design
Installation
Test
Fabrication
Tooling
Design
Installation
Test
Fabrication
CU4: Insulation
400
40
100
0.05 0.10
Design
Tooling
Fabrication
Test
Installation
0.05 0.10
Design
Tooling
Fabrication
Test
Installation
0.05 0.10
Design
Tooling
Fabrication
Test
Installation
0.05 0.10
0.20 0.10
0.50
0.70
150
150
75
20
10
0.10
0.40
0.80 0.80
0.10 0.10 0.50 0.10
0.50
150
150
75
20
10
0.20 0.10
0.50
0.70
0.10
0.40
0.80 0.80
0.10 0.10 0.50 0.10
0.50
150
150
75
20
10
0.20 0.10
0.50
0.70
0.10
0.40
0.80 0.80
Input
Output
Conceptually Design
Assemble
Test
Design
Tooling
Fabrication
Test
Installation
CU1: Body
Winward
CU13, $
CU0:
Thermal
Protecti
on
System
DP12
CU2: Wing
Winward
DP11
CU3: Nose
TPS
FR12
Tooling
CU12, $
FR11
Installation
Process
Matrix
Test
CU11, $
Test
CU1, $
CU4:
Insulation
Functional
Design
Change
DP1
Assemble
FR1
Conceptually Design
CU0: Thermal
Protection
System
Design
Cost
Domain
Tooling
Physical
Domain
Task/Process
model
Design
Functional
Domain
Cost
Domain
Fabrication
Axiomatic Design
Framework
Linking Functional
and Costing Domains
0.20 0.10
0.50
0.70
0.10
0.40
0.80 0.80
150
150
75
20
10
Identify affected
physical interfaces
between
components
CU 1
CU
2
......
......
CU k
Affected
Components
Input
Output
Comment
MIT
design
tooling
fabricate
test
design
code
test
.....
.....
design
perform analysis
tooling
fabricatio
n
test
Tasks Required to
Implement
Changes
Iterative Model
Determines Time
to Complete the
Changes
$ - -
$ - -
$ - -
$ - -
$--
$ - -
$ - -
.....
.....
$ - -
$ - -
$ - -
$ - -
$ - -
Cost Required to
Implement Changes
Iteration model
Task A Task B
Task A
Task B
0.5
0.3
un = WT un 1
U = u0 + u1 + Lu N
= u0 + WT u0 + WT (WT u0 )L
= (1 + WT + WT 2 + L + WT N ) u0
Work completion curve
for the original design
Cost penalty = Y - X
% completion
(hr)
50%
Summary
Task
Model
CU13, $
FR121
FR122
DP111
DP112
DP121
DP122
CU2, $
CU21, $
CU1: Body
Winward
FR112
DP1112
DP1211
DP1212
MIT
40
100
0.05 0.10
Tooling
150
0.20 0.10
150
0.50
Fabrication
0.10
75
0.80 0.80
20
10
0.50
0.70
Test
Installation
0.40
0.05 0.10
Tooling
Fabrication
0.50
Test
0.70
Design
Tooling
150
0.20 0.10
150
75
0.50
0.10
20
0.40
0.80 0.80
10
0.05 0.10
Fabrication
Tooling
Fabrication
Test
Installation
150
150
0.20 0.10
0.50
0.70
Test
Installation
Design
Installation
Test
Fabrication
Tooling
Design
Installation
Test
Fabrication
Tooling
Design
Installation
400
Installation
CU4:
Insulation
DP1111
CU2: Wing
Winward
FR1211 FR1212
CU3: Nose
TPS
FR1111 FR1112
CU4: Insulation
Assemble
Test
Design
CU22, $
Conceptually Design
Design
FR111
Test
DP12
Installation
DP11
CU0:
Thermal
Protecti
on
System
FR12
Test
CU12, $
FR11
Fabrication
Process
Matrix
Tooling
CU11, $
Design
CU1, $
Test
DP1
Assemble
FR1
Conceptually Design
CU0: Thermal
Protection
CU1: Body Winward
System
Fabrication
Cost
Domain
Tooling
Physical
Domain
Design
Functional
Domain
75
0.10
0.40
20
10
0.80 0.80
0.05 0.10
150
0.20 0.10
0.10
150
75
20
10
0.50
0.50
0.70
0.40
0.80 0.80
Steps
1.
2.
3.
4.
5.
MIT