Beruflich Dokumente
Kultur Dokumente
Assembly Chart
Flow Diagram
From-To Chart
Assembly Chart
It is an analog model of the assembly
process. Circles with a single link denote
basic components, circles with several
links denote assembly
operations/subassemblies, and squares
represent inspection operations. The
easiest method to constructing an
assembly chart is to begin with the
original product and to trace the product
disassembly back to its basic components.
Operations Process Chart
By superimposing the route sheets and
the assembly chart, a chart results that
gives an overview of the flow within
the facility. This chart is operations
process chart.
Flow Process Chart
This chart uses circles for
operations, arrows for transports,
squares for inspections, triangles for
storage, and the letter D for delays.
Vertical lines connect these symbols
in the sequence they are performed.
Multi-Product Process Chart
END-TO-END
BACK-TO-BACK FRONT-TO-FRONT
More than 2
machines /operator 1 machine/operator
CIRCULAR
ODD-ANGLE
Flow Pat.: Flow within Departments (cont.)
Very popular.
U flow Combine receiving Circular Terminate flow.
/shipping. Simple to
flow Near point of origin
administer
On adjacent sides
Flow within a facility considering the
locations of entrance and exit (cont.)
On opposite sides
Vertical Flow Pattern
Flow between buildings exists Ground level ingress (entry) Ground level ingress (entry)
and the connection between and egress (exit) are required and egress (exit) occur on the
buildings is elevated same side of the building
Travel between floors occurs on Some bucket and belt Backtracking occurs due to the
the same side of the building conveyors and escalators result return to the top floor
in inclined flow
Flow Planning
Planning effective flow involves combining the above patterns with adequate isles to
obtain progressive movements from origin to destination.
An effective flow can be achieved by maximizing directed flow paths, reducing
flow, and minimizing the costs of flow.
A directed flow path is an uninterrupted flow path progressing directly from
origin to destination: the figure below illustrates the congestion and undesirable
intersections that may occur when flow paths are interrupted .
Warehouse
Warehouse
Assembly
Assembly
Turning
Milling
Milling
Turning
Stores
Stores
Press
Press
Plate
Plate
Stores 12 6 9 1 4 Stores 6 12 9 1 4
Milling 7 2 Turning 3 4
Turning 3 4 Milling 7 2
Press 3 1 1 Press 3 1 1
Plate Plate
3 1 4 3 1 3 4 3
Assembly Assembly
1 7 1 7
Warehouse Warehouse
Original Flow Pattern Revised Flow Pattern
Flow Patterns
Press
Warehouse
Assembly
Turning
Milling
Store
Press
Plate
Stores Turning Milling
Warehouse Assembly Plate
Press
Warehouse
Assembly
Turning
Milling
Store
Press
Plate
Stores Turning Milling
Warehouse Assembly Plate
Volume
High
Product
Planning
Department
Product
Layout Product
Family
Medium Planning
Fixed Location Process
Department
Layout Layout
Group Technology
Fixed Materials Layout Process
Location
Planning
Planning
Department
Department
Low
Low Medium High Variety
Fixed Product Layout
TM DM TM TM
BM TM TM
Flow Dominance Measure
Notations:
M: number of activities.
Nij: number of different types of items moved between activities i and j.
fijk: flow volume between i and j for item k (in moves/time period).
hijk: equivalence factor for moving item k with respect to other items moved
between i and j (dimensionless).
wij: equivalent flow volume specified in from-to chart (in moves/time period),
N ij
w ij = f ijk h ijk .
k 1
Flow Dominance Measure (cont.)
fU f '
Flow dominance measure = f =
fU fL
where 1
M M
2
w ij
2
M 2w 2
i 1 j 1
M 2
1
M M
w
i 1 j 1
ij
f
'
, w = 2
w M
1 1
M M 1 2 2 1 2
fU M , fL M
( M 1 ) ( M 2
1 ) (M 1 )(M
2
1 )
The upper bound fU is only guaranteed to work when each process plan includes all
activities. In this case, 0 f 1.
Flow Dominance Measure (cont.)
Three cases :
1. f 0 a few dominant flows exist. product layout.
can use operations process chart as starting point for developing layout and
material handling system design.
quantitative measures principal source of activity relationship.
2. f 1 many nearly equal flows exist.
any layout equally good with respect to flows .
qualitative measures principal source of activity relationship.
3. 0 << f << 1 no dominant flows exist. difficult to develop layout.
process or product family layout .
both quantitative and qualitative measures important source of activity
relationship.
Example 2
Given three machines (activities) labeled 1, 2 & 3,
To
1 2 3
From
110
1 0 1 15 0
Equivalent 25 w12 = 25,
Flow Volume
From-To Chart w21 = 10, etc
2 25 0 1 10
10 10
3 1 15 0 0
15
Example 2 (cont.)
(2 5 1 0 1 0 1 5 )
M = 3 and w = 6 .6 7
32
1
( 2 5 1 0 1 0 1 5 ) ( 3 6 .6 7 )
2 2 2 2 2 2 2
32 1
f
'
= 1 .3 5 2
6 .6 7
1 1
3 3 1
2 2 1 2
fU 3 = 1 .9 8 4 a n d f L 3 0 .7 5
( 3 1 ) ( 3 2
1 ) (3 1 )(3 1 )
2
1 .9 8 4 1 .3 5 2
f 0 . 5 1 2 2 no dominant flows exist
1 .9 8 4 0 .7 5 (likely, since 3 different process plans)
Qualitative Measures
Closeness values (A, E, I, O, U, X) used to indicate physical proximity
requirements between activities.
Relationship Chart can only show symmetric relationships, as compared
to From-to Chart (wij wji possible).
Relationship Chart is starting point for developing layout when 0 << f 1.
If f 1, then dont need to consider flow (only qualitative relationship)
If f <<1, then one can convert equivalent flow volumes to closeness values so
that material flow relationships can be considered along with qualitative
relationship.
If f 0, then can still convert to relationship chart if significant qualitative
relationship exists, otherwise, just use operations process chart.
Conversion Method
Part Part
P1 P2 P3 P4 P5 P6 P1 P3 P2 P4 P5 P6
M1 1 M1 1
M2 1 1 1 M4 1 1
Machine
Machine
M3 1 1 1 M6 1 1
M4 1 1 M2 1 1 1
M5 1 1 M3 1 1 1
M6 1 1 M5 1 1
M7 1 1 M7 1 1
Row and Column Masking (R&CM) Algorithm
1. Draw a horizontal line through the first row. Select any 1 entry in the matrix
through which there is only one line.
2. If the entry has a horizontal line, go to step 2a. If the entry has a vertical line,
go to step 2b.
2a. Draw a vertical line through the column in which this 1 entry appears. Go to
step 3.
2b. Draw a horizontal line through the row in which this 1 entry appears. Go to
step 3.
3. If there is any 1 entries with only one line through them, select any one and go
to step 2. Repeat until there are no such entries left. Identify the corresponding
machine cell and part family. Go to step 4.
4. Select any row through which there is no line. If there are no such rows, stop.
Otherwise, draw a horizontal line through this row, select any 1 entry in the
matrix through which there is only one line, and go to step 2.
Example 3 Solution
M1 1 2 M1 1
M2 1 1 1 M2 1 1 1 2
3
Machine
Machine
M3 1 1 1 M3 1 1 1
3
M4 1 1 M4 1 1
4
M5 1 1 M5 1 1
4
M6 1 1 M6 1 1
7
M7 1 1 M7 1 1
1 5 1 5 8 6
Single Linkage (S-Link) Clustering Algorithm
M1 1 1 1 1 1 1 1 1 1
M2 1 1 1 1 1
M3 1 1 1 1 1
M4 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1
Machine
M5
1 1 1 1
M6
1 1 1 1 1 1
M7
1 1 1 1 1 1 1 1 1 1
M8
1 1 1 1 1
M9
1 1 1 1 1 1 1 1 1
M10 1 1 1 1 1
M11
Example 4: Initial Similarity Coefficient Matrix
Machine
M1 M2 M3 M4 M5 M6 M7 M8 M9 M10 M11
M1
M2 0.08
M3 0.00 0.43
M10 0.43 0.45 0.23 0.43 0.43 0.36 0.00 0.17 0.00
M11 0.00 0.00 0.00 0.00 0.00 0.00 0.57 0.37 0.67 0.00
Example 4: Dendrogram Based on S-Link
0.00
0.25
Similarity
Levels
0.50
0.75
1.00
M1 M4 M5 M2 M6 M3 M8 M10 M7 M9 M11
Machine
Example 4: Machine Part Groups using S-Link
Part
P1 P3 P16 P2 P15 P22 P20 P21 P7 P11 P8 P19 P5 P12 P13 P6 P14 P18 P9 P10 P17 P4
M5 1 1 1 1 1 1 1 1 1
M1 1 1 1 1 1 1 1 1 1
M4 1 1 1 1 1 1 1 1 1
M10 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1
Machine
M2
1 1 1 1
M6
1 1 1 1 1
M3
1 1 1 1 1 1 1 1 1 1
M8
1 1 1 1 1 1
M7
1 1 1 1 1
M9 1 1 1 1 1
M11
Average Linkage (A-Link) Clustering Algorithm
The similarity coefficient between two machine cells is defined as the average
of pairwise similarity coefficients between all members of the two cells.
Machine Cell
(M1, M4) (M2, M6) M3 M5 (M7, M9) M8 M10 M11
(M1, M4)
(M2, M6) 0.04
M3 0.00 0.47
Machine Cell
Machine Cell
(M1, M4 , M5) (M2, M6) M3 (M7, M9, M11) M8 M10
M3 0.00 0.47
Machine Cell
(M1, M4 , M5) (M2, M6) (M3, M8) (M7, M9, M11) M10
Machine Cell
(M1, M4, M5, M10) (M2, M6, M3, M8) (M7, M9, M11)
Machine Cell
0.25
Similarity
Levels
0.50
0.75
1.00
M1 M4 M5 M10 M2 M6 M3 M8 M7 M9 M11
Machine
Example 4: Machine Part Groups using A-Link
Part
P1 P3 P16 P2 P15 P22 P20 P21 P7 P11 P8 P19 P5 P12 P13 P6 P14 P18 P9 P10 P17 P4
M5 1 1 1 1 1 1 1 1 1
M1 1 1 1 1 1 1 1 1 1
M4 1 1 1 1 1 1 1 1 1
M10 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1
Machine
M2
1 1 1 1
M6
1 1 1 1 1
M3
1 1 1 1 1 1 1 1 1 1
M8
1 1 1 1 1 1
M7
1 1 1 1 1
M9 1 1 1 1 1
M11
Comparison
R&CM is the simplest clustering algorithm.
A major disadvantage of R&CM is that when the machine part matrix contains one or more
bottleneck machines (machines that belong to more than one cell) or exceptional parts (parts
that are processed in more than one cell), the algorithm may provide a solution with all
machines in a cell and all parts in a corresponding part family.
The major advantages of S-Link are its simplicity and minimal computational requirement.
In S-Link, once pairwise similarity coefficients are computed and the similarity coefficient
matrix is constructed, the matrix can be used to develop the dendrogram which represents
the machine cells at different threshold values.
The major drawback of S-Link is the chaining problem. Due to the chaining problem, two
machine cells may join together just because two of their members are similar while the
remaining members may remain far apart in terms of similarity.
The chaining problem of S-Link can be overcome by using A-Link. Since in A-Link two
machine cells merge based on the overall similarity coefficient between all their members, it
is unlikely that two similar members in two cells cause the cells to merge while other
members are not similar enough. A-Link provides a more reliable solution to the machine
cells formation problem.