Basic Algorithms for

Layout Problem
TI4101 Facility Layout
Video ini dibuat hanya bertujuan sebagai
materi daring yang pendistribusiannya
terbatas pada media pembelajaran di
lingkungan Institut Teknologi Bandung.
Penggunaan konten sebagian maupun
keseluruhan untuk kepentingan lainnya
dapat berkonsultasi langsung dengan
Kelompok Keahlian Sistem Manufaktur
Institut Teknologi Bandung.

TI4101 Facility Layout | Group Technology Layout 2

Tujuan & Prasyarat
• Tujuan Instruksional Umum
• Mahasiswa mampu m e r a n ca n g tata letak fasilitas sistem
manufaktur, yang meliputi mesin, tempat kerja, dan gudang
serta sistem pemindahan material-nya.

• Tujuan khusus
• Mampu menggunakan algoritma yang tepat untuk
menyelesaikan permasalahan tata letak

TI4101 Facility Layout | Basic Algorithms for Layout Problems 3

Outline

• Introduction
• Heuristic Algorithms
• Software for layout modeling
• Layout issues in modern manufacturing systems

TI4101 Facility Layout | Basic Algorithms for Layout Problems 4

Introduction

• A model itself does not provide a solution to a problem

• Algorithms or solution techniques have to be developed to

solve a model. An algorithm is a step-by-step procedure
that finds a solution to a model and hence to the problem,
in a finite number of steps.

• We introduce algorithms that have been developed for the

layout problem

TI4101 Facility Layout | Basic Algorithms for Layout Problems 5

Introduction
• Algorithms developed can be divided into two categories:
• Optimal Algorithms (discussed in Ch. 5)
• Heuristic Algorithms

• All optimal algorithms developed suffer from

disadvantages: the memory and computational time
requirements are extremely high increase exponentially as
the problem size increases.

• Hence, there are many more heuristic algorithms for

solving the layout problem
TI4101 Facility Layout | Basic Algorithms for Layout Problems 6
He u r is t ic Algo r it h m s

• Can be classified into 3 categories:

• Construction Algorithms

• Improvement Algorithms

• Hybrid Algorithms

TI4101 Facility Layout | Basic Algorithms for Layout Problems 7

Co n s t r u ct io n Algo r it h m s

• MST (Modified Spanning Tree)

• PAG (Planar Adjacency Graph)

• CORELAP

TI4101 Facility Layout | Basic Algorithms for Layout Problems 8

MST Algo r it h m s

• Single-row layout problem

• Similar to the spanning tree algorithm (Heragu, Kusiak,

1988)

TI4101 Facility Layout | Basic Algorithms for Layout Problems 9

De p a r t m e n t a l Pla n n in g
Here are the steps of the MST algorithm:
Step 1 Given the flow matrix [𝑓𝑓𝑖𝑖𝑖𝑖 ], clearance matrix [𝑓𝑓𝑖𝑖𝑖𝑖 ], and machine lengths 𝑙𝑙𝑖𝑖𝑖𝑖 ,
1
compute an adjacency weight matrix [𝑓𝑓𝑖𝑖𝑖𝑖 ], where 𝑓𝑓𝑖𝑖𝑖𝑖 = (𝑓𝑓𝑖𝑖𝑖𝑖 ) 𝑑𝑑𝑖𝑖𝑖𝑖 + 2
𝑙𝑙𝑖𝑖 + 𝑙𝑙𝑗𝑗 .
Step 2 Find the largest element in [𝑓𝑓𝑖𝑖𝑖𝑖 ] and the corresponding 𝑖𝑖, 𝑗𝑗. Denote this pair 𝑖𝑖, 𝑗𝑗
as 𝑖𝑖 ∗ , 𝑗𝑗 ∗ . Connect machines 𝑖𝑖 ∗ , 𝑗𝑗 ∗ . Set 𝑓𝑓𝑖𝑖∗𝑗𝑗∗ = 𝑓𝑓𝑖𝑖∗𝑗𝑗∗ = −∞.
Step 3 Find the largest element of 𝑓𝑓𝑖𝑖∗𝑘𝑘 𝑓𝑓𝑗𝑗∗𝑙𝑙 in row 𝑖𝑖 ∗ , 𝑗𝑗 ∗ of matrix [𝑓𝑓𝑖𝑖𝑖𝑖 ]. If 𝑓𝑓𝑖𝑖∗𝑘𝑘 ≥ 𝑓𝑓𝑗𝑗∗𝑙𝑙 ,
connect 𝑘𝑘 to 𝑖𝑖 ∗ , remove row 𝑖𝑖 ∗ from matrix [𝑓𝑓𝑖𝑖𝑖𝑖 ], and set 𝑖𝑖 ∗ = 𝑘𝑘. Otherwise,
connect 𝑙𝑙 to 𝑗𝑗 ∗ , remove row 𝑗𝑗 ∗ , column 𝑗𝑗 ∗ from matrix [𝑓𝑓𝑖𝑖𝑖𝑖 ], and set 𝑗𝑗 ∗ = 𝑙𝑙. Set
𝑓𝑓𝑖𝑖∗𝑗𝑗∗ = 𝑓𝑓𝑖𝑖∗𝑗𝑗∗ = −∞.
Step 4 Repeat step 3 until all machines are connected. The sequence of machines
obtained determines the arrangement of machines.

TI4101 Facility Layout | Basic Algorithms for Layout Problems 10

Co n t o h Algo r it h m a MST (1)
In p u t d a t a
Clearence dij = 2 feet

St e p 1
1
𝑓𝑓′𝑖𝑖𝑖𝑖 = (𝑓𝑓𝑖𝑖𝑖𝑖 ) 𝑑𝑑𝑖𝑖𝑖𝑖 + 𝑙𝑙𝑖𝑖 + 𝑙𝑙𝑗𝑗
2
1
𝑓𝑓′12 = 12 2 + 20 + 10
2
𝑓𝑓𝑓12 = 204

TI4101 Facility Layout | Basic Algorithms for Layout Problems 11

Exa m p le : [MST]
Flo w

Assume that the clearance

between each pair of machines
must be at least 2 m

STEP-1 : Compute (𝑓𝑓𝑖𝑖𝑖𝑖 )

Ad ja ce n cy We igh t Ma t r ix
1
𝑓𝑓′𝑖𝑖𝑖𝑖 = (𝑓𝑓𝑖𝑖𝑖𝑖 ) 𝑑𝑑𝑖𝑖𝑖𝑖 + 𝑙𝑙𝑖𝑖 + 𝑙𝑙𝑗𝑗
2

TI4101 Facility Layout | Basic Algorithms for Layout Problems 12

Exa m p le : [MST]
STEP-2 (1): Find the largest element in [ f ′ ij ], and the corresponding i, j

1 6

Alternatif : 1-2 atau 6-2

Karena mempunyai fij

𝑓𝑓′𝑖𝑖∗𝑗𝑗∗ = 𝑓𝑓′𝑗𝑗∗𝑖𝑖∗ = −∞
STEP-2 (2): sama  pilih salah satu
Misal 1-2
x

2 1 6
x
STEP- 3 (1) : Find the largest element TI4101 Facility Layout | Basic Algorithms for Layout Problems 13
Exa m p le : [MST]
i*
STEP-3 (2) : remove row i*, column i* from matrix

x
2 1 6 4
STEP- 3 (5) : Find the largest element
and connect it to exiting solution
x
STEP-3 (6) : Set 𝑓𝑓𝑓𝑖𝑖∗𝑗𝑗∗ = 𝑓𝑓𝑓𝑗𝑗∗𝑖𝑖∗ = −∞

2 1 6 4
x

x i*
STEP-3 (7) : remove row i*, column i* from matrix

TI4101 Facility Layout | Basic Algorithms for Layout Problems 14

Exa m p le : [MST]
STEP-3 (8)

x 2 1 6 4 3
x

STEP-3 (9)

x 5 2 1 6 4 3
x

TI4101 Facility Layout | Basic Algorithms for Layout Problems 15

Exa m p le : [Ou t p u t ]
AISLE
2m

F5 F2 F1 F6 F4 F3

0 10 12 22 24 44 46 56 58 78 80 96
x5=5 x2=17 x1=34 x6=51 x2=64 x2=88

Jarak antara F1 dengan F2 : | x1-x2| = | 34-17| = 17 m e t e r

Jarak antara F1 dengan F3 : | x1-x2| = | 34-88| = 54 m e t e r

Hitung jarak antar fasilitas  m a t r ix ja r a k

TI4101 Facility Layout | Basic Algorithms for Layout Problems 16

On gk o s Ma t e r ia l Ha n d lin g

=SUMPRODUCT(B4:G9;K4:P9)*D11

TI4101 Facility Layout | Basic Algorithms for Layout Problems 17

PAG

TI4101 Facility Layout | Basic Algorithms for Layout Problems 18

Gr a p h Th e o r e t h ic Ap p r o a ch

• Untuk multi-row layout problem

A planar adjacency graph (PAG)

TI4101 Facility Layout | Basic Algorithms for Layout Problems 19
Ma xim a l PAG

• Beginning with a triangular face in which the sum of

the weights of the three arcs is maximum
• Add one node at a time, in such a way that :
• The sum of the weights of the arcs is large
• The planarity of the resulting graph is maintained

TI4101 Facility Layout | Basic Algorithms for Layout Problems 20

A He u r is t ic Algo r it h m fo r Id e n t ifyin g
Ma xim a l PAG

TI4101 Facility Layout | Basic Algorithms for Layout Problems 21

Exa m p le – 12 Ma ch in e s

Flow matrix (in thousands of trips)

TI4101 Facility Layout | Basic Algorithms for Layout Problems 22
Exa m p le – 12 Ma ch in e s

Flow matrix (in thousands of trips)

TI4101 Facility Layout | Basic Algorithms for Layout Problems 23
Exa m p le – 12 Ma ch in e s

Flow matrix (in thousands of trips)

TI4101 Facility Layout | Basic Algorithms for Layout Problems 24
Ma xim u m PAG

Dual of maximal PAG

TI4101 Facility Layout | Basic Algorithms for Layout Problems 25

CORELAP

TI4101 Facility Layout | Basic Algorithms for Layout Problems 26

CORELAP

• It converts qualitative input data (obtained from

ARC) into quantitative data
• CORELAP calculates the Total Closeness Rating
(TCR) for each facility
• Facility with the highest TCR is selected and
placed in the center of the layout

TI4101 Facility Layout | Basic Algorithms for Layout Problems 27

CORELAP

• If two or more facilities share the highest TCR, select one with
the highest area (if there is still a tie, select the first such facility).

• Selection of the second facility depends on the interaction

with the permanent facility (placed in the layout).

• The temporary facility (unselected facility) with highest adjacency

relationship (A, E, I, etc.) with the permanent facility is selected

TI4101 Facility Layout | Basic Algorithms for Layout Problems 28

CORELAP
• The third and subsequent facilities are selected on the basis of their
relationship with the permanent facilities.
• The e n t e r in g fa cilit y is placed in the location that maximizes the PR
(placement rating) –For an example, see Fig. 6.4

TI4101 Facility Layout | Basic Algorithms for Layout Problems 29

Exa m p le 2: [Ad ja ce n cy Re l]

Scoring :
A = 32, E=16, I=8,
O=4, U=2, X=1

1 square = 6,000 s q u a r e
fe e t

TI4101 Facility Layout | Basic Algorithms for Layout Problems 30

CORELAP
3 3

5 1 1

5 4 4

2 4 4

2 2
Sco r in g : A = 10, E=8, I=5, O=4, U=2, X=1

TI4101 Facility Layout | Basic Algorithms for Layout Problems 31

 Ap a k a h s a u d a r a s u d a h
p a h a m algoritma CORELAP?

Da p a t k a n s a u d a r a
menggunakannya ?

TI4101 Facility Layout | Basic Algorithms for Layout Problems 32

Basic Algorithms for
Layout Problem
TI4101 Facility Layout
Im p r o ve m e n t Algo r it h m s

• 2-OPT
• 3-OPT
• CRAFT

TI4101 Facility Layout | Basic Algorithms for Layout Problems 34

2-Op t Algo r it h m s

TI4101 Facility Layout | Basic Algorithms for Layout Problems 35

Fa cilit ie s a n d Sit e s

A Layout of (m.n) facilities Sites in which the (m.n) facilities are

to be placed
TI4101 Facility Layout | Basic Algorithms for Layout Problems 36
Exa m p le : [2-Op t Algo r it h m ]

TI4101 Facility Layout | Basic Algorithms for Layout Problems 37

So lu t io n

TI4101 Facility Layout | Basic Algorithms for Layout Problems 38

So lu t io n

TI4101 Facility Layout | Basic Algorithms for Layout Problems 39

So lu t io n

TI4101 Facility Layout | Basic Algorithms for Layout Problems 40

 Iterasi Iengkap 2 Opt

Solusi awal 1 2 2 1 3 2 4 2
OFV awal
3 4 3 4 1 4 3 1

Misalkan solusi ini menghasilkan OFV < OFV awal, maka

1 3 1 4
solusi tersebut akan menjadi solusi awal pada iterasi
2 4 3 2 berikutnya

1 2
4 3

1 4 4 1 3 4 2 4
Iterasi kedua
3 2 3 2 1 2 1 3

1 3 1 2 Jika pada iterasi tertentu tidak ditemukan OFV < OFV

4 2 3 4 awal, maka stop

1 4
2 3
3-Op t Algo r it h m

TI4101 Facility Layout | Basic Algorithms for Layout Problems 42

Iterasi Iengkap 3 Opt

Solusi awal 1 2 3 1 4 1
OFV awal
3 4 2 4 3 2

1 4
2 3
Jika pada iterasi ini ditemukan OFV < OFV awal, maka
maka solus terbaik tersebut menjadi solusi awal pada
iterasi berikunya
Jika tidak ditemukan adanya OFV < OFV awal, maka stop
CRAFT
• Computerized Relative Allocation of Facility Technique
(Armour and Buffa, 1963)

• Up till now, It is still popular and widely used in practice

• CRAFT requires the input data:

• Dimension of the building
• Dimension of facilities
• Flow of material and cost per unit load per unit distance
• An initial layout
• Restriction on location of facilities (fixed facilities)
TI4101 Facility Layout | Basic Algorithms for Layout Problems 44
CRAFT
• Given the initial layout, CRAFT computes the distance
between centers of each pair facility and determine the
cost of the initial layout.

• CRAFT considers exchanging the location of certain pair of

facilities

• The facility pairs considered either have the same area or

are adjacent (See Fig. 6.13)

TI4101 Facility Layout | Basic Algorithms for Layout Problems 45

CRAFT:[Es t im a t e d Co s t ]
To calculate the estimated cost reduction, CRAFT interchanges the
coordinates of facilities i and j whose exchange is being considered.
If the exchange of facilities i and j is being considered, the cost
reduction is estimated using this expression:

𝑛𝑛 𝑛𝑛 𝑛𝑛 𝑛𝑛

� 𝑓𝑓𝑖𝑖𝑖𝑖 𝑑𝑑𝑖𝑖𝑖𝑖 + � 𝑓𝑓𝑗𝑗𝑘𝑘 𝑑𝑑𝑗𝑗𝑘𝑘 − � 𝑓𝑓𝑗𝑗𝑘𝑘 𝑑𝑑𝑖𝑖𝑘𝑘 − � 𝑓𝑓𝑖𝑖𝑖𝑖 𝑑𝑑𝑗𝑗𝑘𝑘 (1)

𝑘𝑘=1,𝑘𝑘≠𝑖𝑖,𝑘𝑘≠𝑗𝑗 𝑘𝑘=1,𝑘𝑘≠𝑗𝑗,𝑘𝑘≠𝑖𝑖 𝑘𝑘=1,𝑘𝑘≠𝑖𝑖,𝑘𝑘≠𝑗𝑗 𝑘𝑘=1,𝑘𝑘≠𝑖𝑖,𝑘𝑘≠𝑗𝑗

TI4101 Facility Layout | Basic Algorithms for Layout Problems 46

CRAFT
• Each iteration, CRAFT can examine a maximum n(n-1)
possible exchanges, (n = #of facilities)

• The location exchange that result in the greatest estimated

cost reduction is made

• The algorithm is stopped if no two-way exchange results in

a lower cost.

TI4101 Facility Layout | Basic Algorithms for Layout Problems 47

CRAFT:[Exch a n ge Fa cilit ie s ]
• CRAFT is also capable of performing:

• Three way exchanges

• Two-way exchanges followed by three way exchanges

• Three way exchanges followed by two-way exchanges

TI4101 Facility Layout | Basic Algorithms for Layout Problems 48

CRAFT
• The original version was capable of handling only 40
facilities (Please check the capability of CRAFT in the QSB).

• In general, better the starting solution, the better the final

solution.

• This is true with CRAFT also.

TI4101 Facility Layout | Basic Algorithms for Layout Problems 49

Exa m p le :[CRAFT]

TI4101 Facility Layout | Basic Algorithms for Layout Problems 50

Exa m p le :[CRAFT]

TI4101 Facility Layout | Basic Algorithms for Layout Problems 51

 Da t a
In p u t
CRAFT

TI4101 Facility Layout | Basic Algorithms for Layout Problems 52

 OUTPUT:
[CRAFT]

TI4101 Facility Layout | Basic Algorithms for Layout Problems 53

 OUTPUT:
[CRAFT]

TI4101 Facility Layout | Basic Algorithms for Layout Problems 54

 OUTPUT:
[CRAFT]

TI4101 Facility Layout | Basic Algorithms for Layout Problems 55

 OUTPUT:
[CRAFT]

56

TI4101 Facility Layout | Basic Algorithms for Layout Problems 56

 OUTPUT:
[CRAFT]

TI4101 Facility Layout | Basic Algorithms for Layout Problems 57

 OUTPUT:
[CRAFT]

TI4101 Facility Layout | Basic Algorithms for Layout Problems 58

 OUTPUT:
[CRAFT]

TI4101 Facility Layout | Basic Algorithms for Layout Problems 59

Hyb r id Algo r it h m s

• All improvement algorithms require an initial layout

• The better the starting solution, the better the final
solution
• A hybrid algorithm uses a construction algorithm to
produce an initial layout and then improve it by an
improvement algorithm.
• BLOCPLAN is a hybrid algorithm.
• R-MAT (Iskandar, 1985)

TI4101 Facility Layout | Basic Algorithms for Layout Problems 60

BLOCPLAN
• Can develop a single-story or multi-story layout
• Can handle quantitative or qualitative data
• Can handle a maximum of 18 facilities
• Three ways of providing flow data:
• ARC
• From-To-Chart
• Product-Routing data
• BLOCPLAN converts flow matrix into an equivalent relationship chart
by dividing the maximum flow element by 5 (See Table 6.2).
• Then rel chart is used to develop a layout

TI4101 Facility Layout | Basic Algorithms for Layout Problems 61

Ta b le 6.2

Flow Value Between Relationship Indicator

Facilities I and j assigned to Faciilities I and j
321-400 A
241-320 E
161-240 I
81-160 O
0-80 U

TI4101 Facility Layout | Basic Algorithms for Layout Problems 62

BLOCPLAN

• BLOCPLAN can develop a layout:

• Randomly using a construction algorithm;
• Using an embedded improvement algorithm; or
• Using an automatic search algorithm
• The improvement algorithm executes an exchange and
calculates the adjacency score and the rel-dist score of
the new layout.

TI4101 Facility Layout | Basic Algorithms for Layout Problems 63

Ad ja ce n cy Sco r e a n d Re l-Dis t Sco r e
𝑛𝑛−1 𝑛𝑛
∑𝑖𝑖=1 ∑𝑗𝑗=𝑖𝑖+1 𝑅𝑅𝑖𝑖𝑖𝑖 𝐷𝐷𝑖𝑖𝑖𝑖
𝑛𝑛−1 𝑛𝑛
∑𝑖𝑖=1 ∑𝑗𝑗=𝑖𝑖+1 𝑅𝑅𝑖𝑖𝑖𝑖
and the rel-dist score is given by
𝑛𝑛−1 𝑛𝑛

� � 𝑑𝑑𝑖𝑖𝑖𝑖 𝑅𝑅𝑖𝑖𝑖𝑖
𝑖𝑖=1 𝑗𝑗=𝑖𝑖+1

Where,
1 𝑖𝑖𝑖𝑖 𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓 𝑖𝑖 𝑎𝑎𝑎𝑎𝑎𝑎 𝑗𝑗 𝑎𝑎𝑎𝑎𝑎𝑎 𝑜𝑜𝑜𝑜 𝑡𝑡𝑡𝑡𝑡 𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠 𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓 𝑎𝑎𝑎𝑎𝑎𝑎 𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎
𝐷𝐷𝑖𝑖𝑖𝑖 �
0 𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜
𝑅𝑅𝑖𝑖𝑖𝑖 𝑛𝑛𝑛𝑛𝑛𝑛𝑛𝑛𝑛𝑛𝑛𝑛𝑛𝑛 𝑣𝑣𝑣𝑣𝑣𝑣𝑣𝑣𝑣𝑣 𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎 𝑡𝑡𝑡𝑡 𝑡𝑡𝑡𝑡𝑡 𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟 𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐 𝑏𝑏𝑏𝑏𝑏𝑏𝑏𝑏𝑏𝑏𝑏𝑏𝑏𝑏 𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓 𝑖𝑖 𝑎𝑎𝑎𝑎𝑎𝑎 𝑗𝑗
𝑛𝑛 𝑡𝑡𝑡𝑡𝑡𝑡𝑡𝑡𝑡𝑡 𝑛𝑛𝑛𝑛𝑛𝑛𝑛𝑛𝑛𝑛𝑛𝑛 𝑜𝑜𝑜𝑜 𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓
𝑑𝑑𝑖𝑖𝑖𝑖 𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟 𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑 𝑏𝑏𝑏𝑏𝑏𝑏𝑏𝑏𝑏𝑏𝑏𝑏𝑏𝑏 𝑡𝑡𝑡𝑡𝑡 𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐 𝑜𝑜𝑜𝑜 𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓 𝑖𝑖 𝑎𝑎𝑎𝑎𝑎𝑎 𝑗𝑗
TI4101 Facility Layout | Basic Algorithms for Layout Problems 64
BLOCPLAN

• The Criterion used is R-score

• R-score=1 – (rel-dist score-LB)/(UB-LB)
• UB: Upper Bound LB: Lower Bound
• R-score =1 means that the solution is optimal
• Hence, BLOCPLAN is trying to develop the layout with R-
score being close to one.

TI4101 Facility Layout | Basic Algorithms for Layout Problems 65

So ft w a r e fo r la yo u t m o d e llin g
• CORELAP
• CRAFT
• BLOCPLAN
• FactoryCAD
• FactoryPLAN
• FactoryFLOW
• (See more in IE Solutions magazine, August
1995)

TI4101 Facility Layout | Basic Algorithms for Layout Problems 66

La yo u t Is s u e s in Mo d e r n
Ma n u fa ct u r in g Sys t e m s
• The layout problem discussed has been based on three
assumptions:
• The layout problem is two-dimensional
• Information on future manufacturing activities is known at the time
facility design decisions are made
• The product mix and volume remain fairly constant

• These may have been justified in traditional manufacturing

systems but they no longer hold in modern systems

TI4101 Facility Layout | Basic Algorithms for Layout Problems 67

La yo u t Is s u e s in Mo d e r n
Ma n u fa ct u r in g Sys t e m s
• A stable business environment –the traditional manufacturing systems
• A high level of volatility and uncertainty in the current industrial climate
• Effective lifetime of a layout is two years (Nicol and Hollier, 1983)
• The lifetime has decreased further say to one year or less in the past
decade
• Due to the high rate of technological innovations as well as the
frequent changes in product design and functional demanded by
customers
• Re-layout will become more common that layout of new facilities in the
future systems (the Dynamic layout problem)

TI4101 Facility Layout | Basic Algorithms for Layout Problems 68

La yo u t Is s u e s
• Hence, the manufacturer needs to consider expansion in vertical
dimension –transforming a 2-D layout problem into a 3-D layout
one.

• The distance between facilities situated in different floors may be

nonlinear.

• Many algorithms are available the multi-floor problem (e.g.

BLOCPLAN, SPACECRAFT, CRAFT 3-D, MULTIPLE)

TI4101 Facility Layout | Basic Algorithms for Layout Problems 69