Beruflich Dokumente
Kultur Dokumente
3 4
5 6
1
Reed’s Plant Layout Procedure Layout Planning Chart
Analyze the product or products to be produced
7 8
Muther’s
Systematic Layout
Planning (SLP)
Procedure
9 10
11 12
2
Alternative Block Layout Algorithmic Approaches
The relative placement of departments on the
basis of their “closeness ratings” or “material
flow intensities” is one that can be reduced to
an algorithmic process.
Algorithm classification
Type of input data
qualitative “flow” data (relationship chart)
quantitative flow matrix (from-to chart); numerical
values of closing rating ~ mostly used
both qualitative and quantitative (BLOCPLAN, used one
at a time)
13 14
15 16
Algorithm Classification
Layout representation
discrete (grid size<->computational
burden)
continuous (rectangular building and
department shapes)
department cannot be split
Any grid assigned to a department must be
“reachable” form any other such grid
enclosed void (atrium)
17 18
3
Relationship Diagramming for
Algorithm Classification New Layouts
Layout improvement Step 1. Select the first department to enter the layout
- select the department with the greatest # of “A”
start with an initial layout
Step 2. Select the second department to enter the
improve through incremental changes layout – have an “A” with the 1st department
Layout construction Step 3. Select the third department to enter the layout
develop a layout from scratch - AA, AE, AI, A*, EE, EI, E*, II, I*
given dimension (basic assumption in the Step 4. Determine the fourth department to enter the
book) layout - AAA, AAE, AAI, AA*, AEE, AEI
Step n. Department n is placed according to the rules
“green field”: site plan
described in Steps 3 and 4
19 20
21 22
23 24
4
Graph-Based Construction Adjacency graphs for
Method for New Layouts alternative block layouts
It is often used with an adjacency-
based objective.
1960s Krejcirik; 1970s Seppanen and
Moore; similar to Muther’s SLP
25 26
Graph-Based Construction
Method for New Layouts
The score does not account for distance, nor
does it account for relationships other than
those between adjacent departments
Dimensional specifications of departments are
not considered; length of common boundaries
between adjacent departments are not
considered
The arcs do not intersect (planarity; 共平面)
The score is very sensitive to the assignment
of weights
27 28
Graph-Based Construction
Method for New Layouts
1. Select the department pair with the largest
weight
2. Select the third department that has the
largest sum of the weights with the first two
departments to enter
3. Pick the fourth department to enter on a face
(a bounded region of a graph) of the graph
4. Determine an adjacency graph ->
reconstruct a corresponding block layout
29 30
5
Computer-Aided Layout
Techniques
31 32
Example 6.1
35 36
6
37 38
39 40
41 42
7
Flexible Layout
43