Layout Strategy

Layout Strategy
Layout Strategy
"A functional design can promote skill, economy,
conveniences, and comforts; a non-functional
design can impede activities of all types, detract
from quality of care, and raise costs to
intolerable levels." ...
Hardy and Lammers
Layout Strategy
Hospital functions:
bed-related inpatient functions
outpatient-related functions
diagnostic and treatment functions
administrative functions
service functions (food, supply)
research and teaching functions
Layout Strategy
Physical relationships between these functions
determine the configuration of the hospital.
Movement and communication of people, materials,
and waste.
the physical configuration of a hospital and its
transportation and logistic systems are inextricably
intertwined.
The transportation systems are influenced by the
building configuration, and the configuration is
heavily dependent on the transportation systems.
Layout Strategy
The hospital configuration is also influenced by site
restraints and opportunities, climate, surrounding
facilities, budget, and available technology. New
alternatives are generated by new medical needs
and new technology.
uilding Attributes
Regardless of their location, size, or budget, all hospitals
should have certain common attributes.
Efficiency and Cost-Effectiveness
Flexibility and Expandability
Therapeutic Environment
Cleanliness and Sanitation
Accessibility
Controlled Circulation
Aesthetics
Security and Safety
Sustainability
An efficient hospital layout should:
Promote staff efficiency by minimizing distance of
necessary travel between frequently used spaces
Allow easy visual supervision of patients by limited staff
nclude all needed spaces, but no redundant ones. This
requires careful pre-design programming.
Provide an efficient logistics system, which might include
elevators, pneumatic tubes, box conveyors, manual
or automated carts, and gravity or pneumatic chutes,
for the efficient handling of food and clean supplies
and the removal of waste, recyclables, and soiled
material.
Make efficient use of space by locating support spaces
so that they may be shared by adjacent functional
areas, and by making prudent use of multi-purpose
spaces
Consolidate outpatient functions for more efficient
operationon first floor, if possiblefor direct
access by outpatients
Group or combine functional areas with similar system
requirements
Provide optimal functional adjacencies, such as locating
the surgical intensive care unit adjacent to the
operating suite.
These adjacencies should be based on a detailed
functional program which describes the hospital's
intended operations from the standpoint of patients,
staff, and supplies.
uilding Attributes
Accessibility
Aesthetics
Security and Safety
Sustainability
Since medical needs and modes of treatment will
continue to change, hospitals should:
Follow modular concepts of space planning and layout.
Use generic room sizes and plans as much as possible,
rather than highly specific ones
e served by modular, easily accessed, and easily
modified mechanical and electrical systems.
Where size and program allow, be designed on a
modular system basis,
e open-ended, with well planned directions for future
expansion; for instance positioning "soft spaces"
such as administrative departments, adjacent to
"hard spaces" such as clinical laboratories
uilding Attributes
Accessibility
Aesthetics
Security and Safety
Sustainability
Hospital patients are often fearful and confused and
these feelings may impede recovery.
Every effort should be made to make the hospital
stay as unthreatening, comfortable, and stress-
free as possible.
The interior designer plays a major role in this effort
to create a therapeutic environment. A hospital's
interior design should be based on a
comprehensive understanding of the facility's
mission and its patient profile.
The characteristics of the patient profile will
determine the degree to which the interior
design should address aging, loss of visual
acuity, other physical and mental disabilities,
and abusiveness.
Using familiar and culturally relevant materials
wherever consistent with sanitation and other
functional needs
Using cheerful and varied colours and textures,
keeping in mind that some colours are
inappropriate and can interfere with provider
assessments of patients' pallor and skin tones,
disorient older or impaired patients, or agitate
patients and staff, particularly some psychiatric
patients
Admitting ample natural light wherever feasible and
using colour-corrected lighting in interior spaces
which closely approximates natural daylight
Providing views of the outdoors from every patient
bed, and elsewhere wherever possible; photo
murals of nature scenes are helpful where
outdoor views are not available
Designing a "way-finding" process into every
project. Patients, visitors, and staff all need to
know where they are, what their destination is,
and how to get there and return.
A patient's sense of competence is encouraged by
making spaces easy to find, identify, and use
without asking for help. uilding elements,
colour, texture, and pattern should all give cues,
as well as artwork and signage.
uilding Attributes
Accessibility
Aesthetics
Security and Safety
Sustainability
Appropriate, durable finishes for each functional
space.
Careful detailing of such features as doorframes,
casework, and finish transitions to avoid dirt-
catching and hard-to-clean crevices and joints.
Adequate and appropriately located housekeeping
spaces.
Special materials, finishes, and details for spaces
which are to be kept sterile, such as integral
cove base. The new antimicrobial surfaces might
be considered for appropriate locations.
uilding Attributes
Accessibility
Aesthetics
Security and Safety
Sustainability
Accessibility
All areas, both inside and out, should:
Should, be designed so as to be easy to use by the
many patients with temporary or permanent
handicaps
Ensuring grades are flat enough to allow easy
movement and sidewalks and corridors are wide
enough for two wheelchairs to pass easily
Ensuring entrance areas are designed to
accommodate patients with slower adaptation
rates to dark and light; marking glass walls and
doors to make their presence obvious
uilding Attributes
Accessibility
Aesthetics
Security and Safety
Sustainability
A hospital is a complex system of interrelated functions
requiring constant movement of people and goods.
Much of this circulation should be controlled.
Outpatients visiting diagnostic and treatment areas
should not travel through inpatient functional areas
nor encounter severely ill inpatients.
Typical outpatient routes should be simple and clearly
defined.
Visitors should have a simple and direct route to each
patient nursing unit without penetrating other
functional areas.
Separate patients and visitors from
industrial/logistical areas or floors
Outflow of trash, recyclables, and soiled materials
should be separated from movement of food and
clean supplies, and both should be separated
from routes of patients and visitors
Transfer of cadavers to and from the morgue should
be out of the sight of patients and visitors
Dedicated service elevators for deliveries, food and
building maintenance services
uilding Attributes
Accessibility
Aesthetics
Security and Safety
Sustainability
Aesthetics
Aesthetics is closely related to creating a
therapeutic environment (homelike, attractive.) t
is important in enhancing the hospital's public
image and is thus an important marketing tool.
A better environment also contributes to better staff
morale and patient care.
Aesthetics
ncreased use of natural light, natural materials, and
textures
Use of artwork
Attention to proportions, colour, scale, and detail
right, open, generously-scaled public spaces
Homelike and intimate scale in patient rooms,
day rooms, consultation rooms, and offices
Compatibility of exterior design with its physical
surroundings
uilding Attributes
Accessibility
Aesthetics
Security and Safety
Sustainability
Security and Safety
n addition to the general safety concerns of all
buildings, hospitals have several particular
security concerns:
Protection of hospital property and assets,
including drugs
Protection of patients, including incapacitated
patients, and staff
Safe control of violent or unstable patients
.
Security and Safety
Vulnerability to damage from terrorism because of
proximity to high-vulnerability targets, or
because they may be highly visible public
buildings with an important role in the public
health system
uilding Attributes
Accessibility
Aesthetics
Security and Safety
Sustainability
Sustainability
Hospitals are large public buildings that have a
significant impact on the environment and
economy of the surrounding community. They
are heavy users of energy and water and
produce large amounts of waste.
ecause hospitals place such demands on
community resources they are natural
candidates for sustainable design.
What is Facility Layout
Location or arrangement of everything within &
around buildings
Objectives are to maximize
Customer satisfaction
Utilization of space, equipment, & people
Efficient flow of information, material, & people
Employee morale & safety
Requirements of a Good Layout
an understanding of capacity and space
requirements
selection of appropriate material handling
equipment
decisions regarding environment and aesthetics
identification and understanding of the
requirements for information flow
identification of the cost of moving between the
various work areas
nterdepartmental Flow of Parts
1 2 3 4 5
1
2
3
4
5
50 100 0 0 20
30
50
10
0
20 0 100
50 0
0
nterdepartmental Flow Graph
Showing Number of Weekly Loads
100
50 30
10
50
100
1
2
3
1 5
Computer Programs to Assist in Layout
CRAFT
SPACECRAFT
CRAFT 3-D
MULTPLE
CORELAP
ALDEP
COFAD
FADES - expert system
Work Cells - Some Advantages
Reduced work-in-process inventory
Less floor space required
Reduced raw material and finished goods inventories
required
Reduced direct labor costs
Heightened sense of employee participation
ncreased utilization of equipment machinery
Reduced investment in machinery and equipment
Note: Green & Sadowski report increased capital
investment and lower machine utilization
Relationship Chart
1 Pres|dent
0
2 6ost|ng U
A A
3 Eng|neer|ng |
0
4 Pres|dent's 8ecretary
1 1
2 2
3 3
0rd|nary 0rd|nary
c|oseness: c|oseness:
Pres|dent [1} & Pres|dent [1} &
6ost|ng [2} 6ost|ng [2}
Abso|ute|y necessary: Abso|ute|y necessary:
Pres|dent [1} & Pres|dent [1} &
8ecretary [4} 8ecretary [4}
4 4
| = |mportant
U = Un|mportant
Assembly Line alancing Steps
1. Determine tasks (operations)
2. Determine sequence
3. Draw precedence diagram
4. Estimate task times
5. Calculate cycle time
6. Calculate number of work stations
7. Assign tasks
8. Calculate efficiency
Facility Layout : Arrangement of areas
Minimize material-handling costs
Utilize space efficiently
Utilize labor efficiently
Eliminate bottlenecks
Facilitate communication and interaction
Reduce manufacturing cycle time
Reduce customer service time
Eliminate wasted or redundant movement
ncrease capacity
Types
1.Product layout 1.Product layout
2. Process layout 2. Process layout
3.Fixed position layout 3.Fixed position layout
product layout
every item to be every item to be produced follows the same follows the same
sequence of operations from beginning to end, sequence of operations from beginning to end,
moving from one specialized tool and operation moving from one specialized tool and operation
to another to another
process layout
n a process layout, similar machines or functions are
grouped together; for example, all drill presses may
be positioned in one area and all lathes in another.
universities and hospitals are usually organized
around process layouts; separate locations exist
for classrooms, libraries, offices, and computer
SLP = Systematic Layout Planning
An organized approach
ased on activity relationship chart (shows
desirability of placing two departments close
together)
Trial and error approach
Flow Patterns
System to be adopted for the movement of raw System to be adopted for the movement of raw
materials from the beginning to the end of materials from the beginning to the end of
manufacturing manufacturing
Economical movement of the material throughout Economical movement of the material throughout
the plant the plant
Combination Combination
+ U (L+L) + U (L+L)
S+L S+L
O+U O+U
Line alancing
Appointment of sequential work activities into
workstations to gain a high utilization of labor and
equipment and therefore minimizing idle time
To secure a uniform flow at capacity operation
Line alancing
Grouping or distributing the facilities in an efficient
manner so as to obtain optimal results, i.e.
minimization of idle time
A layout which has equal operating times at the
successive operations in the process as a whole
lock Diagramming: Example
Department Department 1 1 2 2 3 3 4 4 5 5
Load Summary Chart Load Summary Chart
FROM/TO FROM/TO DEPARTMENT DEPARTMENT
1 1 -- 100 100 50 50
2 2 -- 200 200 50 50
3 3 60 60 -- 40 40 50 50
4 4 100 100 -- 60 60
5 5 50 50 --
1 2 3
4 5
lock Diagramming: Example (cont.)
2 3 200 |oads
2 1 150 |oads
1 3 110 |oads
1 2 100 |oads
1 5 0 |oads
3 5 50 |oads
2 5 50 |oads
3 1 10 |oads
1 1 0 |oads
1 5 0 |oads
1 2 3
4
5
100 200
150
50
50
60
40
110
Grid 1
oradjacerl Loads:
11010=150
1 2
3
4
5
100
200
150
50
50
60
40
110
Grid 2
oradjacerl Loads:
0
lock Diagramming: Example (cont.)
1
2
3
4
5 3
2
5
1 4
(a) InitiaI bIock diagram (a) InitiaI bIock diagram (b) FinaI bIock diagram (b) FinaI bIock diagram
Relationship Diagramming
Schematic diagram that uses
weighted lines to denote location
preference
Muther's grid
format for displaying manager
preferences for department locations
Relationship Diagramming: Example
Production Production
Offices Offices
Stockroom Stockroom
Shipping and Shipping and
receiving receiving
Locker room Locker room
TooIroom TooIroom
A A A A
A A
OO
OO
OO
OO
OO
U U
U U
U U
U U
EE
XX
II
-so|ule|v recessa(v
E Espec|a||v |rpo(larl
l lrpo(larl
0 0|av
u ur|rpo(larl
X urdes|(a-|e
-so|ule|v recessa(v
E Espec|a||v |rpo(larl
l lrpo(larl
0 0|av
u ur|rpo(larl
X urdes|(a-|e
Relationship Diagrams: Example (cont.)
(a) ReIationship diagram of originaI Iayout (a) ReIationship diagram of originaI Iayout
Key: Key: A A
EE
II
OO
U U
XX
Offices Offices
Stockroom Stockroom
Locker Locker
room room
TooIroom TooIroom
Shipping Shipping
and and
receiving receiving
(b) ReIationship diagram of revised Iayout (b) ReIationship diagram of revised Iayout
Offices Offices
Stockroom Stockroom
Locker Locker
room room
TooIroom TooIroom
Shipping Shipping
and and
receiving receiving
Key: Key: A A
EE
II
OO
U U
XX
Relationship Diagrams: Example (cont.)
Line alancing Procedure
Draw and label a precedence diagram
Calculate desired cycle time required for the line
Calculate theoretical minimum number of workstations
Group elements into workstations, recognizing cycle
time and precedence constraints
Calculate efficiency of the line
Determine if the theoretical minimum number of
workstations or an acceptable efficiency level has
been reached. f not, go back to step 4.
Part Routing Matrix
Machines
Parts 1 2 3 4 5 6 7 8 9 10 11 12
A x x x x x
B x x x x
C x x x
D x x x x x
E x x x
F x x x
G x x x x
H x x x
Figure 5.8 Figure 5.8
Revised Cellular Layout
3
6
9
AssembIy
1 2
4
8 10
5
7
11
12
A B C
Raw materiaIs
CeII 1 CeII 2 CeII 3
Reordered Routing Matrix
Machines
Parts 1 2 4 8 10 3 6 9 5 7 11 12
A x x x x x
D x x x x x
F x x x
C x x x
G x x x x
B x x x x
H x x x
E x x x
Line alancing Procedure
Draw and label a precedence diagram
Calculate desired cycle time required for the line
Calculate theoretical minimum number of
workstations
Group elements into workstations, recognizing
cycle time and precedence constraints
Calculate efficiency of the line
Determine if the theoretical minimum number of
workstations or an acceptable efficiency level
has been reached. f not, go back to step 4.
NTAL LAYOUT CONSTRUCTON
PreIiminaries
From-To Chart / Flow-etween Chart
REL Chart
Layout Scores
TraditionaI Layout Construction
ManuaI CORELAP AIgorithm
Graph-Based Layout Construction
REL Graph, REL Diagram, Planar Graph
Layout Graph, lock Layout
Heuristic Algorithm to Construct a REL Graph
General Procedure
From-To and Flow-etween Charts
Given M activities, a From-To Chart
represents M(M-1) asymmetric quantitative
relationships.
Example:
where
f
ij
= material flow from activity i to activity j.
I
12
I
13
I
23
I
32
I
21
I
31
A FIow-Between Chart represents
M(M-1)/2 symmetric quantitative
relationships, i.e.,
g
ij
= f
ij
+ f
ji
, for all i > j,
where
g
ij
= material flow between activities i
and j.
Relationship (REL) Chart
A ReIationship (REL) Chart
represents
M(M-1)/2 symmetric qualitative
relationships, i.e.,
where
r
ij
A, E, , O, U}: Closeness
Value (CV) between activities i
and j; r
ij
is an ordinal value.
A number of factors other than material
handling flow (cost) might be of primary
concern in layout design.
r
ij
values when comparing pairs of activities:
A = absolutely necessary 5 %
E = especially important 10 %
= important 15 %
O = ordinary closeness 20 %
U = unimportant > 50 %
X = undesirable 5 %
V(r
ij
) = arbitrary cardinal value assigned to
r
ij
, e.g., V(U) = 1, etc.
r
12
r
13
r
23
Adjacency
Two activities are (fuIIy) adjacent in a layout if they share a common border of positive lenght, i.e., not just a
point.
Two activities are partiaIIy adjacent in a layout if they only share one or a finite number of points, i.e., zero
length.
Let a
ij
0, 1]: adjacency coefficient between activities i and j.
Example: (Fully) adjacent: a
12
= a
13
= a
24
= a
34
= a
45
= 1,
Partially adjacent: a
14
= a
23
= a
25
= , and
Non-adjacent: a
15
= a
25
= 0.
. adiacent not are they iI
and , adiacent partially are they iI ) 1 0 (
, adiacent are i and i activities iI
0
1
a
ii

|
=
3
1 2
4 5
Layout Scores
Two ways of computing layout scores:
Layout score based on distance:
where d
ij
= distance between activities i and j.
Layout score based on adjacency:
where a
ij
0, 1]: adjacency coefficient between activities i and j.

=

= + =
1 M
1 i
M
1 i i
ii ii
d
d ) r ( V LS

=

= + =
1 M
1 i
M
1 i i
ii ii
a
a ) r ( V LS
Traditional Layout Configuration
An Activity ReIationship Diagram is developed from information in the activity
relation chart. Essentially the relationship diagram is a block diagram of the
various areas to be placed into the layout.
The departments are shown linked together by a number of lines. The total number of
lines joining departments reflects the strength of the relationship between the
departments. E.g., four joining lines indicate a need to have two departments
located close together, whereas one line indicates a low priority on placing the
departments adjacent to each other.
The next step is to combine the relationship diagram with departmental space
requirements to form a Space ReIationship Diagram. Here, the blocks are
scaled to reflect space needs while still maintaining the same relative placement
in the layout.
A BIock PIan represents the final layout based on activity relationship information. f
the layout is for an existing facility, the block plan may have to be modified to fit
the building. n the case of a new facility, the shape of the building will confirm to
layout requirements.
A Rating
E Rating
I Rating
O Rating
U Rating
X Rating
Legend
Example
ode Reason
1 Flow oI material
2 Ease oI supervision
3 ommon personnel
4 ontact Necessary
5 onveniences
Rating DeIinition
A Absolutely Necessary
E Especially Important
I Important
O Ordinary loseness OK
U Unimportant
X Undesirable
1. OIIices
2. Foreman
3. onIerence Room
4. Parcel Post
5. Parts Shipment
6. Repair and Service Parts
7. Service Areas
8. Receiving
9. Testing
10. General Storage
O
4
I
5
U
U
U
E
3
U
U
E
3
E
5
O
4
U
O
4
U
U
E
3
A
1
O
3
I
2
U
U
U
I
4
U
U
I
2
U
U
U
U
U
I
2
U
U
A
1
U
O
2
U
I
1
U
I
2
U
U
I
2
U
REL chart
Example (Cont.)
1
0
5 8 7
9 6
4 2 3
1
Activity Relationship
Diagram
Example (Cont.)
2
(125)
$pace Relationship
Diagram
3
(125)
1
(1000)
4
(350)
6
(75)
9
(500)
10
(1750)
5
(500)
8
(200)
7
(575)
Manual CORELAP Algorithm
CORELAP is a construction algorithm to create an activity
relationship (REL) diagram or block layout from a REL chart.
Each department (activity) is represented by a unit square.
Numerical values are assigned to CV's:
V(A) = 10,000, V(O) = 10,
V(E) = 1,000, V(U) = 1,
V() = 100, V(X) = -10,000.
For each department, the TotaI CIoseness Rating (TCR) is the sum
of the absolute values of the relationships with other
departments.
Procedure to Select Departments
1. The first department placed in the layout is the one with the
greatest TCR value. |f a tie
exists, choose the one with more A's.
2. f a department has an X relationship with he first one, it is
placed last in the layout. f a
tie exists, choose the one with the smallest TCR value.
3. The second department is the one with an A relationship
with the first one. f a tie exists,
choose the one with the greatest TCR value.
Procedure to Select Departments
4. f a department has an X relationship with he second one, it
is placed next-to-the-last or
last in the layout. f a tie exists, choose the one with the
smallest TCR value.
5. The third department is the one with an A relationship with
one of the placed departments.
f a tie exists, choose the one with the greatest TCR value.
6. The procedure continues until all departments have been
placed.
Procedure to Place Departments
Consider the figure on the right. Assume that a department is
placed in the middle (position 0). Then, if another
department is placed in position 1, 3, 5 or 7, it is "fuIIy
adjacent with the first one. t is placed in position 2, 4, 6
or 8, it is "partiaIIy adjacent.
8 7 6
5
4 3 2
1

For each position, eighted PIacement (P) is the sum of the numerical values for all pairs of adjacent
departments.
The placement of departments is based on the following steps:
1. The first department selected is placed in the middle.
2. The placement of a department is determined by evaluating all possible
locations
around the current layout in counterclockwise order beginning at the "western
edge.
3. The new department is located based on the greatest WP value.
Example
1. Receiving
2. Shipping
3. Raw Materials Storage
4. Finished Goods Storage
5. ManuIacturing
6. Work-In-Process Storage
7. Assembly
8. OIIices
9. Maintenance
A
A
E
O
U
U
A
O
E
E
E
A
A
X
X
A
U
U
A
O
O
A
O
A
O
U
E
A
U
E
U
E
A
U
O
A
1. Receiving
2. Shipping
3. Raw Materials Storage
4. Finished Goods Storage
5. ManuIacturing
6. Work-In-Process Storage
7. Assembly
8. OIIices
9. Maintenance
' values
V(A) 125
V(E) 25
V(I) 5
V(O) 1
V(U) 0
V(X) -125
Partial adjacency
0.5
Table of TCR Values
Department $ummary
Dept.
1 2 3 4 5 6 7 8 9 A E I O U X
%R Order
1
2
3
4
5
6
7
8
9
- A A E O U U

A

O
A

-

E

A

U O U

E A
A E

- E A U U

E A
E

A

E

-

E O A

E U
U O

A E

-

A A

O A
U O

U

O A

-

A

O O
U U

U

A

A A -

X A
A E

E

E O O X -

X
O

U A

U

A

O A

X -
3

1

0 2

2

0
2

2

0 1

3

0
3

3

0 0

2

0
2

4

0 1

1

0
4

1

0 2

1

0
2

0

0 4

2

0
4

0

0 0

3

1
1

3

0 2

0

2
3

0

0 2

2

1
402
301
450
351
527
254
625
452
502
(5)
(7)
(4)
(6)
(2)
(8)
(1)
(9)
(3)
Example (cont.)
125
125
125 125
62.5 62.5
62.5 62.5
125
62.5 62.5
62.5 187.5
5 125
62.5 187.5
187.5 187.5
0
62.5 0
5
187.5
187.5
9 187.5
62.5 125 62.5
0
62.5 125
0
125.5 0
5
1.5
9
126.5
0.5 1 0.5
0
1 63.5
3
125
62.5
62.5
Example (cont.)
125 5
137.5
9
25 0
100
3 37.5
37.5
12.5
1
12.5 12.5
62.5
62.5 137.5 37.5
125
5
9
125
12.5
3 87.5
137.5
12.5
1
62.5 125
62.5
0 0 25
4
125 62.5
5
9
1
125
3 1
0
1
1 1.5
125
188
4
1.5 0.5
2 1
0.5
0.5
63.5
62.5 62.5
Example (cont.)
5
9
75
-60.5
3 112.5
1
87.5 -62.5
-112
4
-37.5 12.5
2
25
12.5
12.5
-37.5
-61.5 25.5 6 12.5
0.5 1 0.5 0.5
5
9
3
1 4 2
6
8
Planar Graph
Assumption:
A PIanar Graph is a graph that can be drawn in two dimensions with no arc crossing.
. otherwise
, adiacent Iully are i and i activities iI
0
1
a
ii
|
|
=
Nonplanar
Planar
A graph is nonplanar if it contains either one of the two Kuratowski graphs:
Relationship (REL) Graph
Given a (block) layout with M activities, a corresponding planar undirected graph, called the ReIationship (REL)
Graph, can always be constructed.
REL
Graph
1 2
5 4 3
6
(Exterior)
1 2
5 4 3
Block Layout
A REL graph has M+1 nodes (one node for each activity and a node for the exterior of the layout. The exterior
can be considered as an additional activity. The arcs correspond to the pairs of activities that are
adjacent.
A REL graph corresponding to a layout is planar because the arcs connecting two adjacent activities can
always be drawn passing through their common border of positive length.
Relationship (REL) Diagram
A ReIationship (REL) Diagram is also an undirected graph,
generated from the REL chart, but it is in general nonplanar.
A REL diagram, including the U closeness values, has ML(M-1)/2
arcs. Since a planar graph can have at most 3M-6 arcs, a
REL diagram will be nonplanar if ML(M-1)/2 > 3M-6.
ML(M-1)/2 > 3M-6 M > 5.
A REL graph is a subgraph of the REL diagram.
For M > 5, at most 3M-6 out of ML(M-1)/2 relationships can be
satisfied through adjacency in a REL graph.
An upper bound on LS
a
, LS
a
U
, is the sum of the 3M-6
longest V(r
ij
)'s.
Maximally Planar Graph (MPG)
A planar graph with exactly 3M-6 arcs is called MaximaIIy PIanar Graph (MPG).
Not MPG since
has only 5 arcs
(5 6 3M-6)
MPG since
has 6 arcs
The interior faces of a graph are the bounded regions formed by its arcs, and its exterior face is the
unbounded region formed by its outside arcs.
IF
1
IF
2
IF
3
EF
The tetrahedron has three interior Iaces (IF
1
, IF
2
and IF
3
) and an exterior Iace (EF)
Maximally Planar Graph (MPG)
The interior faces and the exterior face of an MPG are triangular, i.e., the
faces are formed by three arcs.
Not triangular
Not an MPG
The REL graph of a given a (block) layout may not be an MPG.
Layout
REL Graph
Not an MPG
Maximally Planar Weighted Graph (MPWG)
An MPG whose sum of arc weights is as large as any other possible
MPG is called a MaximaIIy PIanar eighted Graph (MPG).
Using the V(r
ij
)'s as arc weights, a REL graph that is a MPWG has
the maximum possible LS
a
, close to LS
a
U
.
Since it is difficult to find an MPWG, a Heuristic (non-optimal)
procedure will be used to construct a REL graph that is an MPG,
but may not be an MPWG (although its LS
a
will be close to
LS
a
U
).
The Layout Graph is the dual of the REL graph.
Given a graph G, its dual graph G
D
has a node for each face of G
and two nodes in G
D
are connected with an arc if the two
corresponding faces in G share an arc.
Layout Graph
Example.
The number of nodes in G (primal graph) is the same than the number of faces in G
D
(dual graph), and vice versa. n addition,
(G
D
)
D
= G.
Primal Graph is Planar Dual Graph is planar.
G G
D
Layout Graph (Cont.)
Given a layout, the corresponding Iayout graph can always be constructed by placing
the nodes at the corners of the layout where three or more activities meet
(including the exterior of the layout as an activity). The arcs in the graph are the
remaining portions of the layout walls. E.g.,
Layout
Graph
1 2
5 4
3
(Exterior)
Given a REL graph (RG), its corresponding Iayout graph (LG) is LG = RG
D
. E.g.,
Layou
t
c
g
a b
d I
e
h
1 2
5 4
3
6
R
G
LG
RG
D
LG
D
Only activity 3 and
exterior meet here
Activities 3, 5, and
exterior meet here
Layout Graph (Cont.)
f LG is given, then RG = LG
D
, but for layout
construction, the layout is not known initially, so
LG cannot be constructed without RG.
f a planar REL graph (primal graph) exist, the
corresponding layout graph (dual graph) is also
planar. Therefore, it is possible theoretically to
construct a block layout that will satisfy all the
adjacency requirements. n practice, this is not
straightforward because the space requirements
of the activities are difficult to handle.
Example
$pace Requirements
Dept. Area
A 300
B 200
100
D 200
E 100
F (exterior)
REL graph (Primal graph)
A B
D
E F
Example (Cont.)
Layout graph (Dual graph)
A B
D
E F
1
2
3
4
5
7
6
8
Example (Cont.)
A corner point is a point where at least three departments meet, including the exterior department.
Note that each corner point in the block layout corresponds to a node in the layout graph. n the first block
layout, each corner point is defined by "exactly three departments. n this case, there is a one-to-one
correspondence between corner points and nodes in the layout graph. n the square block layout, there
are two corner points defined by four departments, i.e., (A, , C, D) and (, D, E, F). Each of these two
corner points corresponds to two nodes in the layout graph.
Block
Layout
Square Block Layout
(areas are not considered)
A
D
B
E
8 1 6
7 2 3 4
5
A
D
B
E
7
8
8 4
1 5
2 3
F
F
Heuristic Procedure to Construct a Relationship Graph
1. Rank activities in non-increasing order of TCR
k
, k = 1, .,M, where
TCR
k
=
(Note that the negative values of V(r
ik
) and V(r
kj
) are not included in TCR
k
).
2. Form a tetrahedron using activities 1 to 4 (i.e., the activities with the four largest TCR
k
's).
3. For k = 5, ., M, insert activity k into the face with the maximum sum of weights (V(r
ij
)) of k with the three nodes
defining the face (where "insert refers to connecting the inserted node to the three nodes forming the face with
arcs).
4. nsert (M+1)
th
node into the exterior face of the REL graph.
Max0, V(r )} Max0, V(r )}.
ik
i 1
k-1
ki
ik1
M
=

+
Example
O
I
O
A
X
U
U
O
U
U
E
E
A
B
D
E
F
I
E
E
' values
V(A) 81
V(E) 27
V(I) 9
V(O) 3
V(U) 1
V(X) -243
REL chart
Table of TCR Values
Department $ummary
Dept.
A B D E F A E I O U X
%R Order
A - I O I O A 1 0 2 2 0 0 105 2
B I - X U U E 0 1 1 0 2 1 38 5
O X - U E E 0 2 0 1 1 1 58 3
D I U U - U E 0 1 1 0 3 0 39 4
E O U E U - O 0 1 0 2 2 0 35 6
F A E E E O - 1 3 0 1 0 0 165 1
Example (Cont.)
Step 2:
A
F D
A
O
E U
E
I r
AD
V(r
AD
) 9
ExampIe (Cont.)
Step 3: nsert .
A
F D
E
F
IF
1
IF
2
IF
3
I
I I
E
E
E
U
U
U
X X
X
Face LS
a
EF 9 1 27 37 *
IF
1
9 27 - 243 -207
IF
2
9 - 243 1 -233
IF
3
27 - 243 1 -215
Insert B in EF
ExampIe (Cont.)
Step 3 (Cont.): nsert E.
A
F D
B
IF
1
IF
2
IF
3
IF
4
IF
5
EF
Face LS
a
EF 5
IF
1
7
IF
2
33 *
IF
3
31
IF
4
31
IF
5
5
Insert E in IF
2
Example (Cont.)
Step 4: Call exterior activity EX.
A
F D
B
EX
E
Since arcs (AB), (BD),
and (DA) are the
outside
arcs, EX connects to
nodes A, B, and D.
Example (Cont.)
LS
a
U
is the sum of the 3M - 6 ( 3 L 6 - 6 = 12), largest V(r
ij
)'s.
n the last example,
LS
a
U
= V(r
AF
) + V(r
F
) + V(r
CE
) + V(r
CF
) + V(r
DF
) + V(r
A
) + V(r
AD
) + V(r
AC
)
+ V(r
AE
) + V(r
EF
) + V(r
D
) + V(r
E
) = 81 + 27 + 27 + 27 + 27 + 9 + 9 + 3
+ 3 + 3 + 1 + 1 = 218.
For the final REL graph, LS
a
= 218.
LS
a
U
= LS
a
The final REL graph is an MPWG t is optimal.
LS
a
U
> LS
a
The final REL graph may not be an MPWG t may not be optimal.
Using the Heuristic procedure, the generated REL graph will always be an MPG since each face is triangular.
General Procedure for Graph ased Layout Construction
1. Given the REL chart, use the Heuristic procedure to construct the REL
graph.
2. Construct the layout graph by taking the dual of the REL graph, letting
the facility exterior node of the REL graph be in the exterior face of the
layout graph.
3. Convert (by hand) the layout graph into an initial layout taking into
consideration the space requirement of each activity.
REL hart REL
Graph
Layout Graph Initial Layout
Space
Requirement
s
ExampIe
Step 1: (from before)
A
F D
B
EX
E
REL Graph
Example (Cont.)
Step 2: take the dual of RG
F
D
EX
E
A
B
Layout Graph
Example (Cont.)
Step 3:
W Initial layout is
drawn as a square,
but could be any
other shape.
W Only A and B are
nonrectangular.
B D
A
F
E
InitiaI Layout
Comments
1. f an activity is desired to be adjacent to the exterior of a facility (e.g., a
shipping/receiving department), then the exterior could be included in the REL chart
and treated as a normal activity, making sure that, in step 1 of the general procedure,
its node is one of the nodes forming the exterior face of the REL graph.
2. The area of each interior face of the layout graph constructed in step 2 does not
correspond to the space requirements of its activity.
3. n step 3, the overall shape of the initiaI Iayout should be usually be rectanguIar if it
corresponds to an entire building because rectanguIar buiIdings are usuaIIy
cheaper to build; even if the initial layout corresponds to just a department, a
rectangular shape would still be preferred, if possible.
4. n step 3, the shape of each activity in the initial layout should be rectangular if
possible, or at most L- or T-shaped (e.g., activities A and ), because rectanguIar
shapes require Iess waII space to enclose and provide more layout possibilities in
interiors as compared to other shapes.
Comments (Cont.)
5. All shapes should be orthogonaI, i.e., all corners are either 90 or 270
(e.g., a triangle is not an orthogonal shape since its corners could all be
60).
6. n step 1, if the LS
a
of the REL graph is less than LS
a
U
, then the REL
graph may not be optimal. The following three steps may improve the REC
graph for the purpose of increasing LS
a
:
a) Edge Replacement: replace an arc in the REL graph with a new
arc not previously in the graph, without losing planarity, if it
increases LS
a
.
b) Vertex Relocation: move a node in the REL graph connected to
three arcs to another triangular face if it increases LS
a
.
c) Use a different activity to replace one of the four activities of the
tetrahedron formed in step 2 of the Heuristic procedure to construct
a new REL graph.

Layout Strategy

Uploaded by

Copyright:

Available Formats

You might also like

Layout Strategy

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Layout Strategy

Uploaded by

Copyright:

Available Formats

Layout Strategy

You might also like