Layout - Definition

• Layout: the physical arrangement of

– machines,
– equipment,
– workstations,
– people, and
– material handling equipment.
• The final layout plan is the end result of
Facilities Design.

1
 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

Objectives of Facility Layout

• Minimize investment in equipment.

• Minimize production time.

• Minimize material handling cost.

• Maximize utilization of space, equipment, & people

• Maintain flexibility of arrangement and operation.

• Provide safety and comfort to employees.

• Customer satisfaction

• Efficient flow of information, material, & people

2
 Five Types of Facility Design Projects

1. New Facility – fewer restrictions and constraints on the layout since it is

new

2. New Product – integration of a new product into the existing process

and layout

3. Design Changes – incorporate the impact of design changes into the

manufacturing process

4. Cost Reduction – redesign the existing layout to facilitate cost reduction

programs and ideas

5. Retrofit – similar to a new facility layout except with the constraints

present ( ‫)ﺗﺟدﯾد أﺟزاء‬

Facility Layout

• A Layout problem may be to

– determine the location for a new machine,
– develop a new layout for an existing production plant,
– develop a layout for a new production plant,
– etc.
• A Layout problem may arises due to
– changes in the design of a product,
– addition or deletion of a product,
– change in the demand of a product,
– changes in the design of the process,
– addition or deletion of a process,
– replacement of equipment,
– etc.

3
 Layout

Developing the layout is an important step it

serves to establish the physical relationships
between activities.

So, which comes first, the material handling

system or the facility layout? Our answer is,
"Both!" The layout and the handling system
should be designed simultaneously,

Layout

The complexity of the design problem

generally requires that a sequential process be
used. For this reason, we recommend that a
number of alternative handling systems be
developed and the appropriate layout be
designed for each.

4
 Impact of Poor Plant Layout
• High material handling costs
• Cycle and lead time delays
• High WIP inventories
• Lower quality
• Product damage
• Safety and morale problems
• Poor equipment utilization
• Congested aisles
• Wasted floor space
٩

Basic Layout Types

1. Fixed material location departments - Fixed product

layouts
2. Production line departments - Product layouts
3. Product family departments - Product family layouts
4. Process departments - Process layout
5. Hybrid - Mass Customization Layout

١٠

5
 Layout Procedures

Two different categories:

1. Construction - involves developing a new

layout "from scratch“

2. Improvement - generate layout alternatives

based on an existing layout

١١

Layout Procedures

• Apples’s Plant Layout Procedure

(20 steps procedure)

• Reed’s Plant Layout Procedure

(10 steps procedure)
Layout Planning Chart

١٢

6
 Apple’s Plant Layout Procedure

Apple recommended that the following detailed sequence of steps be used in

designing a plant layout.
1. Procure the basic data. 11. Determine storage requirements
2. Analyze the basic data. 12. Plan service and auxiliary activities.
3. Design the productive process. 13. Determine space requirements.
4. Plan the material flow pattern. 14. Allocate activities to total space.
5. Consider the general material handling plan. 15. Consider building type
6. Calculate equipment requirements. 16. Consider master layouts.
7. Plan individual work stations. 17. Evaluate, adjust and check the layout.
8. Select specific material handling equipment. 18. Obtain approval.
9. Coordinate groups of related operations. 19. Install the layout.
10. Design activity relationships. 20. Follow up on implementation of the layout.

Reed’s Plant Layout Procedure

In “planning for and preparing the layout,” Reed recommended that the
following steps be taken in his “systematic plan of attach”:
1. Analyze the product to be produced.
2. Determine the process required to manufacture the product.
3. Prepare layout planning charts.
4. Determine work stations.
5. Analyze storage area requirements.
6. Establish minimum aisle widths.
7. Establish office requirements.
8. Consider personnel facilities and services.
9. Survey plant services.
10. Provide for future expansion.

7
 Algorithmic Approaches

1. Relationship Diagramming - for new layouts

2. Pair-wise Exchange Method- for layout

improvements

3. Graph-Based Construction Method - for new layouts

١٥

Muther’s Systematic Layout Planning

Procedure (SLP)
1. It uses as its foundation the activity
relationship chart,
2. A material flow analysis (From-to-chart) and
an activity relationship analysis (REL chart)
are performed
3. Relationship diagram is developed
4. Determine the amount of space to be
assigned each activity (use departmental
service and area requirement sheets)
5. Space templates are developed for each
planning department this leads to the space
relationship diagram
6. Layout alternatives are developed
١٦

8
 Product Layout

Input Data and Activities

Analysis
1, Flow of Materials 2, Activity Relationships

3, Relationship Diagram

4, Space Requirements 5, Space Available

6, Space Relationship Diagram

Search
7, Modifying Considerations 8, Practical Limitations

9, Develop Layout Alternatives

Selection
10, Evaluation

Input Data/Activities

The first step of SLP is to gather information

about the building including how it will be used and
what flows will be occurring.

Product: What is being used/moved/created?

Quantity: What volume of materials/people/
machines?
Routing: Where are things being moved?
Support: What equipment and systems are needed
to support main operations?
Timing: When will activities occur?

9
 Sources for Data:
Most of the information concerning the types of
parts and assemblies that will produced will come
from documents that you learned about in PP&S
design. These documents include:
 Parts Lists
 Bill of Material
 Process Flow Chart
 Process Map
 Routing Sheets
 Assembly Chart
 Operations Process Chart
 Assembly Precedence Diagram
 Production Schedule

Traditional Layout Configuration

• An Activity Relationship 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, Legend

• The departments are shown linked together by a number of lines, The

A Rating
total number of lines joining departments reflects the strength of the
relationship between the departments, e,g,, four joining lines indicate E Rating
a need to have two departments located close together, whereas one
line indicates a low priority on placing the departments adjacent to I Rating
each other,
O Rating
• The next step is to combine the relationship diagram with
departmental space requirements to form a Space Relationship U Rating
Diagram, Here, the blocks are scaled to reflect space needs while
still maintaining the same relative placement in the layout, X Rating
• A Block Plan represents the final layout based on activity
relationship information, If the layout is for an existing facility, the
block plan may have to be modified to fit the building, In the case of
a new facility, the shape of the building will confirm to layout
requirements,
٢٠

10
 Example 1

REL chart:

1, Offices (1000) Code Reason

O
4 E 1 Flow of material
2, Foreman (125) 5
I O 2 Ease of supervision
5 O 3 U
3, Conference Room (125) 3 Common personnel
U 4 I U
U 2 I U
4 Contact Necessary
4, Parcel Post (350) 2 I 5 Conveniences
U U U
O U 2 O U
5, Parts Shipment (500) 2
U 4 U U I U
U U U 2 I
6, Repair and Service Parts(75)
E U U U 2
3 U U I Rating Definition
7, Service Areas (575) 1
U I A
1 A Absolutely Necessary
E 4 U
8, Receiving (200) 3 E Especially Important
U U
A I Important
9, Testing (900)
E 1 O Ordinary Closeness OK
10, General Storage (1750) 3
U Unimportant
X Undesirable
٢١

Example 1 (Cont,)

5 8 7

10 9 6

4 2 3

Activity Relationship
1
Diagram

٢٢

11
 Example (Cont,)

5 8 7
(500) (200) (575)

9
(500) 6
10 (75)
(1750)

4 2 3
(350) (125) (125)

1
Space Relationship (1000)
Diagram

٢٣

Example (Cont,)

5 8 7 5 8 7
(500) (200) (575) (500) (200) (575)

6 6
(75) (75)
9
(500) 9
(500)
10 2 (125) 10
3 (125)
(1750) (1750)
2 3
(125) (125)
1
(1000)
4 4 1
(350) (350) (1000)

Alternative 2 Alternative 1

٢٤

12
 Systematic Layout Planning—
Example 2: Reasons for Closeness
Code Reason

1 Type of customer

2 Ease of supervision

3 Common personnel

4 Contact necessary

5 Share same price

6 Psychology

٢٥ 10

Systematic Layout Planning--

Example (Importance of Closeness)
Line Numerical
Value Closeness
code weights
A Absolutely necessary 16
E Especially important 8
I Important 4
O Ordinary closeness OK 2
U Unimportant 0
X Undesirable -16

٢٦ 11

13
 Systematic Layout Planning--Example
Relating Reasons and Importance
Area
From To
2 3 4 5 (sq, ft,)
I U A U
1, Credit department 100
6 -- 4 --
U I A
2, Toy department 400
-- 1 1,6
U X
3, Adult books department 300
-- 1
X
4, Camera department 100
1

5, Candy department 100

Letter Closeness rating

Number Reason for rating ٢٧ 12

Systematic Layout Planning--

Example
Initial Relationship Diagram

1 E 3

I 4 U U

2 5
A

٢٨ 13

14
 Systematic Layout Planning--
Example
Initial and Final Layouts

5 2 4 2
3 20 ft
3 1 5 1 4

50 ft

Initial Layout Final Layout

Ignoring space and Adjusted by square

building constraints footage and building
size
٢٩ 14

Relationship Diagramming
REL chart:

- Group Relationships 1, Offices (1000)

O
1st level: A-E-I-O-U-X 4 E
2, Foreman (125)
2nd level: AA, AE, A*, I 5 O
5 O 3 U
EE, EI, E*, II, I*,… 3, Conference Room (125)
4 I U
U
rd
3 Level, AAA, AAE, U 2 I U
4, Parcel Post (350)
AA*, AEE, AE*,… U U 2 I U
th O U 2 O U
4 level 5, Parts Shipment (500) 2
U 4 U U I U
, 6, Repair and Service Parts(75) U U U 2 I
E U U U 2
, 3 U U I
7, Service Areas (575)
, U I A 1
E 4 U 1
- The question to be 8, Receiving (200) 3
U U
answer is which A
department to be 9, Testing (900)
E 1
entered next, 10, General Storage (1750) 3

٣٠

15
 Relationship Diagramming

- The 1st department to enter is 10

10
- The 2nd one is the one that has the
highest rate with 10 (5 and 8) are
candidates, 5 enters since there is an I
10 5
relationship with 2
- The 3rd one
1 2 3 4 8 6 7 9

10 U I U I A U U E 5 10 8

5 U I U U U U U U

is 8 with the highest rate of AU

- The 4th one is 9 5 10 8
1 2 3 4 6 7 9

10 U I U I U U E
9
8 U O U U U U U
5 U I U U U U U
٣١

Relationship Diagramming

5 10 8 5 10 8
- The 5th one to enter is 7

- The 6th on to enter is 6 9 7 9 7

- The 7th one to enter is 2 2 6

5 10 8
- The 8th one to enter is 3
4
9 7
- The 9th one to enter is 1
5 10 8
- The 10th one to enter is 4 3 2 6

1 9 7

3 2 6
٣٢

16
 Relationship Diagramming

- If the space impact is included the

following could be an alternative
layout
4
(350)
4
5 8
(500) (200)

5 10 8
10
(1750)
1
(1000)
1 9 7

3 (125)
7
3 2 6 9 (575)
(500)
6
2 (125) (75)

٣٣

Relationship Diagramming

• Final alternative
4
5 (350) 8
(500) (200)

1 10 7
(1000) (1750) (
5
7
5
3 (125) )

9 6
(500) (75)
2 (125)

٣٤

17
 Graph-based Approach
• Keys:
– A node (O) represents a department
– An arc ( ___ ) represent a relationship
• A weight is assigned to each relationship (Closeness Rating Rel-Chart):
• Rules:
– No arc intersection is allowed
– Dimensional specifications are not considered
– The scores are very sensitive to the numerical weights assigned
– The scores do not represents distances

٣٥

Graph-Based Construction Method

Given the relationship chart
1 Directors Conference Room 1
2
9 3
2 President
8 4
12 10 5
3 Sales
13 0
20 7
4 Personnel
0
2
5 Plant manager

٣٦

18
 Graph-Based Construction Method
• Strategy: iteration is based on inserting a new node
• Step -1: Largest weight-pair departments
20
3 4

• Step -2: Largest weight-pair departments with respect to 3-4

3 4 Total 2

1 8 10 18
12 13
2 12 13 25
(Best)
5 0 2 2
3 4
20
٣٧

Graph-Based Construction Method

Step-3
2
2 3 4 Total

9
1 9 8 10 27 12
13
(Best)
1
5 7 0 9 16 8 10

3 4
20

٣٨

19
 Graph-Based – Step 4
1 2 3 4 2
5 0 7 0 2

Faces Total 9 7
1-2-3 7
12 13
1-2-4 9 5
0
(best) 2
1-3-4 2 1
8 10
2-3-4 9
(best) 3 4
20

٣٩

Adjacency Graphs – Version A

Arc Weight
1
0 1-2 9
9 1-5 0
5
7 2-3 12
2
2
2-4 13
13
2-5 7
12
4 3-4 20
20 4-5 2
3
Total 63
٤٠

20
 Adjacency Graphs – Version B
Arc Weight
5
0 1-5 0
7 2-5 7
1
9 1-2 9
2
10
1-4 10
13
2-4 13
12
4 2-3 12
20 3-4 20
3
Total 71
٤١

Block Layout From The Final Adjacency

Graphs

Arc Weight
12 2 13
1-2 9
1-3 8
9 7
1-4 10
0 1-5 0
1 5
8 2-3 12
2-4 13
2
10 2-5 7
3 3-4 20
20 4 4-5 2
Total 81
٤٢

21
 Pair-wise exchange method
• Improvement: redesign of an existing
facility ( new machine, expansion of
storage, …
• Objective: Minimize the total cost of
MH
– Min MH cost
n n
min z   X ij Cij
i 1 j 1

• X=Number of moves
• C: cost of a move Xij
• Procedure:
1 2 3 4
– Example: ( 4 departments with equal
size) 1 - 10 15 20
– Existing layout and 2 - 10 5
3 - 5
1 2 3 4
4 -

٤٣

Pair-wise exchange method

Cij
• Develop the cost matrix
1 2 3 4 1 2 3 4
• Calculate the total cost
1 - 1 2 3
4 4 2 - 1 2
TotalCost   X ij Cij 3 - 1
i 1 j 1
4 -
TC= (10) ($1)+ (15)(2) +(20)(3)+ (10)(1)+(5)(2)+(5)(1)
= $125
• Feasible alternatives
– (1-2), (1-3), (1-4), (2-3), 2-4), (3-4) because all the
departments are equal in areas Cij
• Check each alternatives
– Alternative 1 exchange 1 by 2 1 2 3 4
– The layout will be 1 - 1 1 2
2 - 2 3
2 1 3 4
3 - 1
4 -
– The Cost matrix will be -------------

٤٤

22
 Pair-wise exchange method
• TC1234 = 125 (existing layout cost)
• TC2134 = (10)(1)+(15)(1)+(20)(2)+(10)(2)+(5)(3)+(5)(1) =105
• TC3214 = 95 Feasible exchange pair is 1-3
• TC4231 = 120
• TC1432 = 105
• TC1324 = 120
• TC1243 = 125
Iteration 1 leads to the following layout
Iteration 2
• TC3214 = 95 (1st iteration layout cost) 3 2 1 4
• TC1234 = 125
• TC3241 = 110
• TC2314 = 90 Feasible exchange pair is 2-3
• TC
Iteration 2 leads to the following layout
2 3 1 4 ٤٥

SLP Example
• XYZ inc, has a facility with 6 depts, (A,B, C, D, E, and F), A summary of
the processing sequence for 10 products and the weekly production
forecasts for the products, and areas are given in the tables below:
Dimension Weekly
(ft*ft) products Processing
Production
Seq,
A 40 x 40
1 ABCDEF 960
B 45 x 45
2 ABCBEDCF 1,200
C 30 x 30
3 ABCDEF 720
D 50 x 50
4 ABCEBCF 2,400
E 60 x 60
5 ACEF 1,800
F 50 x 50
6 ABCDEF 480
7 ABDECBF 2,400
1. F – To Chart 8 ABDECBF 3,000
2. Block laying diagramming using SLP 9 ABCDF 960
3. Developing a block laying using
10 ABDEF 1,200
Relationship diagramming
٤٦

23
a)Construct the F – T Chart
A B C D E F
A-B = 960 + 1,200 + 720 + 2,400
+ 480 + 2,400 + 3,000 + 960 + A X 13,320 1,800 0 0 0
B 0 X 11,400 6,600 4,920 5,400
1,200
C 0 6,600 X 2,400 4,200 3,600
= 13,320 D 0 3,000 1,200 X 5,040 960
B-A = 0 E 0 5,400 7,800 1,200 X 5,160
B-C = 960 + 1,200 + 720 + 2,400 F 0 0 0 0 0 X

+ 480 + 960 = 11,400

C-B = 1,200 + 2,400 + 3,000 =
B C D E F
6,600 A
A X 13,320 1,800 0 0 0
Since we don’t have the Rel chart B X 18,000 9,600 10,320 5,400
we base our closeness rating on C X 3,600 12,000 3,600
material flow information,
D X 6,240 960
AB = A-B + B-A
BC= B-C+C-B E X 5,160
.
F X
.
.
. ٤٧

Rank and Code

A E I

18,000, 13,320 12,000, 10,320, 9,600 6,240, 5,400, 5,160

3,600 1,800, 960, 0, 0, 0

U

O A

B U

A U
Rel. Chart: A E I O U
C E U

A B C D E F O E U

A - A U U U U D E I
B - A E E I I O
C - O E O
E U
D - I U
I
E - I
F
F -

٤٨

24
1st to enter is B (two As’) B
A

A
2nd to enter is C (E & O) B C
B U

A U
3rd to enter is A (A effect) A B C
C E U

4th to enter is E E F O E U
A B C D
D E I
5th to enter is D E A U U U
I O
B E E I
C O E O E U
6th to enter is F A B C
I
D E D F F

A U U
F
B E I
A B C C O O
D E E I I

٤٩

Relationship Diagram

F
A O
E U

A B C I

D E

Block Diagram
F
A B F
I O
C
AA B A C
E E
U E E E D
D I

٥٠

25
 Pairwise Exchange Example

Given:
4-equal size departments are
A B C D
Served by an AGV on a
Linear bidirectional track
As shown. Each machine
block
Is 30X30 ft. The product
routine
Information and required
production
Are given. Determine
arrangement
based on the pairwise
exchange
1 BDCAC 300
method. Assume P/D point
as shown in the figure. 2 BDAC 700
3 DBDCAC 900
4 ABCA 200

٥١

Pair-wise Exchange Example

Arrangement/Costs A B C D A B C D
ABCD = 200 × 30 + 3,300 × 45 + 700 × 75 + 200 ×
15 + 2,800 × 45 + 1,200 × 30 = 372,000 A - 200 3300 700 A - 30 45 75
BACD = 342,000 B - 200 2800
B - 15 45
C - 1200
D - C - 30

D -

CBAD = 507,000
DBCA = 435,000
ABCD = 372,000

B A C D
CABD = 351,000

DACB = 468,000
Find Arrangement BACD

٥٢

26
 Graph-based Approach Example

The ABC cooling and heating company manufactures several different types of air
conditioners. 5 departments are involved in the processing required for the products. A
summary of the processing sequence required for the 5 major products and weekly
production volumes for the products are shown in the table below along with the department
area. Based on the graph-based approach construction method, develop a block layout

Product Process Weekly Department Area

sequence Production
1 ABC 150 A 1500

2 ABED 200 B 1500

3 ACE 50 C 1000

4 ACBE 200 D 2000

5 ADE 250 E 2000

٥٣

Graph-based Approach Example

Dept A B C D E
Solution: A - 350 250 250 0
a) Construct flow between departments
B - - 350 0 400
A-B = 150 + 200 =350
B-A= 0 C - 0 50
AB= A-B +B-A =350
A-C= 50 +200 =250 D - 450
C-A = 0
=================================
E -
b) Weights = flow
1) the largest weight is for the 2 depts. D and E.
2) the 3rd department to enter is B
3) the 4th department to enter is A D E Total D E B Total

4) the 5th department to enter is C but where? A 250 0 250 A 250 0 350 600
.
B 0 400 400 C 0 50 350 400

C 0 50 50
A E B Total
A D E Total A D B Total C 250 50 350 650
C 250 0 50 300 C 250 0 350 600
٥٤

27
 Graph-based Approach Example
D
Adjacency Graph

E C B

Block Layout
D
C A E

٥٥

Need For Change

• Changes in the products
–Changes in design of product
–Eliminating products from the product line
–Introduction of new products
• Changes in the processes
– Change in sequence for existing products
– Replacement of equipment
• Changes in production
– quantities and
– schedule
• Changes in organizational structure (selected Mfg system)
٥٦

28
 Impact of Changes
• Expansion
– Mirror image expansion: simple, free
of bottlenecks and limited to one time
expansion
– Straight line flow expansion:
Unlimited, simple, low add on cost
building but hard to selectively expand
some departments
– T-shape expansion
– U-Shape expansion

٥٧

Computer Aided Layout

• Enhance productivity & Quality of Solution

• Can not Replace human Judgment
• Types of Algorithms
– Type of Input Data
• Qualitative Data- REL Chart
• Quantitative Data – F-T chart
– Objectives:
• Minimizing the sum of flow times distance (Distance-Based Approach)
• Maximizing an adjacency score (Adjacency-Based Approach)

٥٨

29
 Computer Aided Layout

a) Distance-Based Approach
f: flow number between i and j n n
d: distance from i and j MinZ   fdc ij ij ij
c: cost of moving one unit from i to j i 1 j 1
i and j: departments
n: number of departments

b) Adjacency-Based Approach
1) Z= adjacent score
n n
f: flow number between i and j
x: adjacency score
MaxZ   f ij xij
i 1 j 1
= 1 if i and j are adjacent
= 0 otherwise

٥٩

Computer Aided Layout

b) Distance-Based Approach n n n n
2) Z* = Relative efficiency or Efficiency Max*   f ij xij /  f ij
rating i 1 j 1 i 1 j 1
0 < Z* < 1
as Z*  1 all the departments are adjacent
Cij = 1 for the same MH equipment
3) Z^ = Relative efficiency or Efficiency rating
for –ve values of relationships
Cij = 1 for the same MH equipment
+F: positive Rel. group of Depts.
- F: negative Rel. group of Depts.

n n n n n n n n
Max^  ( fij xij   F   fij (1  xij    F )) /( fij    F  f ij    F )
i 1 j 1 i 1 j 1 i 1 j 1 i 1 j 1

٦٠

30
 Computer Aided Layout

Example: Given the flow no. between

departments and the first iteration 1 3 4
layout, find the relative adjacency
score.
2 5
Solution
a) identify the adjacency matrix

1 2 3 4 5
1 2 3 4 5
1 - 1 1 0 0
1 - 5 0 4 -3
2 - 1 0 0
2 - 6 -1 2
3 - 1 1
3 - -6 0
4 - 1
4 - 3
5 -
5 -

٦١

Computer Aided Layout

b) Calculate Z*
n
1 3 4
 f = 5 +0+4-3+6-1+2-6+0+3 = 10
ij
j 1
2 5
n n

 f
i 1 j 1
ij xij = f12*X12 + f13*X13 + f14*X14 +
f15*X15 + f23*X23 + f24*X24 + f25*X25
+ f34*X34 + f35*X35 + f45*X45
= 1*5 +1*0 +4*0+ -3*0 +6*1+
-1*0 + 2*0 + -6*1 + 0*1 1 2 3 4 5 1 2 3 4 5
+3*1 = 8 1 - 5 0 4 -3 1 - 1 1 0 0

Z* = 8/10 = 0.8 close to 1 good 2 - 6 -1 2 2 - 1 0 0

adjacency relationships 3 - -6 0 3 - 1 1
4 - 3 4 - 1
5 - 5 -

٦٢

31
 Computer Aided Layout
c) Calculate Z^
n

 f (+ve) = 5 +0+4+6+2+0+3 = 20
ij
j 1
n F (-ve): (1,5), (2,4), (3,4)
 f (-ve) = -3-1-6 = -10
ij
j 1 F (+ve): the rest

n n
x (+ve) = f12*X12 + f13*X13 +
 fi 1 j 1
ij

f14*X14 + f23*X23 + f25*X25 +

ij
1 3 4
f35*X35 + f45*X45
2 5
= 1*5 +1*0 +4*0+ 6*1+ 2*0
+ 0*1 + 3*1= 14 1 2 3 4 5
n n

 f x (-ve) = f15*X15 + f24*X24 + f34*X34

i 1 j 1
ij ij
1 2 3 4 5 1 - 1 1 0 0
= -3*1 +-1*1 + -6*0= -4 1 - 5 0 4 -3 2 - 1 0 0
2 - 6 -1 2 3 - 1 1
Z^ = (14- (-4))/(20 –(-10)) = 0.6 3 - -6 0 4 - 1

Not close to 1 good adjacency 4 - 3 5 -

relationships 5 -
٦٣

Computer Aided Layout

• Layout Representation Format

Discrete:
- Area of each department is rounded to the
nearest integer
- Grid size affects the resolution and the
computation time

Continuous
- No grid
- More difficult
- Restricted to rectangular shape

٦٤

32