CHƯƠNG 9:

VỊ TRÍ THIẾT BỊ - NHÀ MÁY

TS. Le Duc Dao

Bộ môn Kỹ Thuật Hệ Thống Công Nghiệp
Khoa Cơ Khí
1 Trường Đại học Bách Khoa Tp. Hồ Chí Minh
Phone: 0937286746
Email: lddao@hcmut.edu.vn
 VỊ TRÍ THIẾT BỊ - NHÀ MÁY
Các hệ số ảnh hưởng đến quyết định vị trí cho thiết bị hay nhà máy:

Factor
Plant location and facility
Location
transportation
Market
labor
Power
Climate condition
Water
Land
Opponents
Disposal of waste
2
PLANT LOCATION, FACTORS AFFECTING
PLANT LOCATION
 https://www.youtube.com/watch?v=OshyCwH3TJM

3
RESOURCE LOCATION-ALLOCATION
Resource Location-Allocation in factory
Qualitative selection method
Quantitative selection method
 The importation of affected factor
 Quantitative and Profit-cost analysis

4
RESOURCE LOCATION-ALLOCATION
 Algorithm: We will select the plan based on weighted
factors
 Determine the factor and weight
 Determine the score of each plan related to mentioned factor

 Determine the overall score of each plan

 We will choose the plan has the largest score

5
 COEFFICIENT WEIGHTED METHOD
EXAMPLE

The Manager concern three factor for building the new factory such as labor ,
Preparedness of material and potential market. After evaluation, the score has
been listed in the table below

Factor Weight P–A P– B P–C

Labor skill 0.5 70 70 50
Preparedness of material 0.3 60 40 90
Potential market 0.2 70 95 60

6
 Overall Score = score of P-A Weighted factor score

Factor PA – A PA – B PA – C
Score W-score Score W- Score W-score
score
Labor skill (0.5) 70 35 70 35 50 25
Preparedness of material 60 18 40 12 90 27
(0.3)
Potential market (0.2) 70 14 95 19 60 12
Overall Score 67 66 64

7
  What happen if we change the weighted score of factors,
for example , 0.45 (Labor ), 0.4 (material preparedness),
0.15 potential market

Factor PA – A PA – B PA – C
Score W- Score W- Score W-score
score score
Labor skill 70 31.5 70 31.5 50 22.5
Preparedness of material 60 24 40 16 90 36
Potential market 70 10.5 95 14.25 60 9
Labor skill 66 61.75 67.5

8
The plan has been evaluatively subjectively based on the weighted
scores, thus easily causing the in-correct chosen .
 BÀI TẬP THỰC HÀNH!
PHƯƠNG PHÁP ĐÁNH GIÁ TRỌNG SỐ HỆ
SỐ
 Given the table below, could you give the manager for the plan
selection

Factor P–A P– B P –C
Score W- Score W- Score W-score
score score
H1 (0.2) 50 80 45
H2 (0.35) 70 60 75
H3 (0.15) 60 50 70
H4 (0.3) 40 70 85

 Phương án??
9
BÀI TẬP THỰC HÀNH 2!
Ba phương án xác định vị trí của trạm phân phối hàng hóa
được xem xét với các thông số cho như trong Bảng bên
dưới. Phương án nên được chọn là:

Hệ số Trọng số PA – A PA – B PA – C

Nhân lực 0.3 70 70 50

Thị trường 0.4 60 40 80

Nguồn cung cấp 0.3 70 85 60

10
FINANCIAL ANALYSIS ANALYSIS
If the fixed cost and variable cost of each production plan
has been deterministed we can select the plan having the
lowest cost

https://www.youtube.com/watch?v=f640XIT7ZgA
11
FINANCIAL ANALYSIS
 The company considers three production plan with
variable cost and fixed cost shown in the table

Production plan Fixed cost Variable cost

1 year (unit)
A 10.000.000 250
B 25.000.000 150
C 60.000.000 50

12
FINANCIAL ANALYSIS
 Total production cost = (fix cost ) + (variable cost ) x
(Production quantity
- plan – A:

Total cost= 10.000.000 + 250 x 250.000 = 72.500.000

- plan – B:

Total cost = 25.000.000 + 150 x 250.000 = 62.500.000

- Plan – C:

Total cost = 60.000.000 + 50 x 250.000 = 72.500.000

Plan B is the optimal Plan when production is under 250000
units/years
• What happen if production changed

13
 FINANCIAL ANALYSIS
Total
cost

Production quantity

 Production cost changed according to the production

quantity

14
BÀI TẬP THỰC HÀNH 3!

15
FACTORY LOCATION-ALLOCATION
MODEL

 Has been applied in a lots of field

 Hospitalallocation
 School/University Allocation
 Warehouse allocation
 Canteen Allocation

16
 FACTORY LOCATION-ALLOCATION
MODEL
 Decide the distance based on Rectilinear:

D  x1  x2  y1  y2

Decide the distance based Euclidean distance

17
FACTORY LOCATION-ALLOCATION
MODEL
 Ojective function

 Distance

 Với:
New location

Current location

Weighted presented the relationship between new

machine/department with the current one

Distance between new machine/department with 18

the current one
FACTORY LOCATION-ALLOCATION
MODEL
 We can solved it using two approach
Minisum approach
We minimize the weighted distance between the new machine/department
with the current one

Minimax approach
We minimize the maximum distance the new machine/department with the current
one be

19
MINISUM APPROACH

 Objective

sau trong việc xác định giá trị

1. X-coordinate of the new machine will be the same with the X-
coordinate of one of current machine/department

20
BÀI TOÁN VỊ TRÍ ĐƠN MINISUM
CHO THIẾT BỊ/NHÀ MÁY
 Algorithm
1. Define X-coordinate
 Arrange X-coordinate of current machine/department by
increasing order
 Calculate the cumulative addition of weighted
 If cumulative addition is larger the ½ of total , this location will be
the X-coordinate of new machine/ department
2. Similar for y-coordinate

21
MINISUM APPROACH
 If we cannot locate the new machine to the best location,
the optimal location can be determined based on the
objective function. Choose the min f(x,y)

22
  Define the new supply warehouse for 5 firm having
VÍ DỤ the coordinate (X,Y) in the table below

23
 BÀI TOÁN VỊ TRÍ ĐƠN MINISUM CHO
THIẾT BỊ/NHÀ MÁY – VÍ DỤ
Coordinate
Current Weighted
machine i number

Coordinat Weighted number define x coordinate :

Current
machine i e

24
BÀI TOÁN VỊ TRÍ ĐƠN MINISUM CHO
THIẾT BỊ/NHÀ MÁY – VÍ DỤ Quan hệ với thiết bị
Tọa độ
mới (SLVC/ngày)
Máy i
define y coordinate :

25
 BÀI TOÁN VỊ TRÍ ĐƠN MINISUM CHO
THIẾT BỊ/NHÀ MÁY – VÍ DỤ
 Optimal location will be x=5 và y=4
 Objective value

26
BÀI TOÁN VỊ TRÍ ĐƠN MINISUM CHO
THIẾT BỊ/NHÀ MÁY – VÍ DỤ

Kết quả:

 Mô hình LINGO

27
BÀI TOÁN VỊ TRÍ ĐƠN MINISUM CHO
THIẾT BỊ/NHÀ MÁY – VÍ DỤ
Suppose we cannot locate the machine to the best choice
Which location (O1-O7) should be use to put the new machine

28
BÀI TOÁN VỊ TRÍ ĐƠN MINISUM CHO
THIẾT BỊ/NHÀ MÁY – VÍ DỤ
 Objective of (O1-O7)
 O1 

 O2 

 O3 

 O4 

29
MINISUM –EXERCISES
Current equipment has been listed below
Equipme x y Weight of new-
nt current
A 1 3 6
B 2 5 8
C 1 7 3
D 8 2 4
E 6 9 3
F 5 4 1

Find the optimal location for new equipment and obj

Define the optimal location for new machine if we only have three30
potention location (6,4), (4,7), (3,8)
BÀI TOÁN VỊ TRÍ ĐƠN MINIMAX CHO
THIẾT BỊ/NHÀ MÁY –VÍ
MôDỤ
hình LINGO

Kết quả:
X = 4.45
Y = 3.54
Đoạn thẳng qua hai điểm:

Sẽ đi qua điểm
(X,Y)=(4.45,3.54)
31
MINIMAX APPROACH
 Minimax approach
 We minimize the maximum distance the new
machine/department with the current one be

 Algorithm
 We calculate 5 optimal value

The optimal location will be located in the line

between

With

32

The objective value c5/2

We want to locate fire station between 8 department. Fire station should be put
near all department. You may use the minimax approach to give us the optimal
location

33
MINIMAX APPROACH

Optimal location should be ?

34
MINIMAX APPROACH

35
BÀI TOÁN VỊ TRÍ ĐƠN MINIMAX CHO
THIẾT BỊ/NHÀ MÁY –VÍ
MôDỤ
hình LINGO

Kết quả:
X = 4.45
Y = 3.54
Đoạn thẳng qua hai điểm:

Sẽ đi qua điểm
(X,Y)=(4.45,3.54)
36
BÀI TẬP THỰC HÀNH!
Given the department A-K with the coordinate X,Y below.
Use the minimax approach to locate the health care
center to support all of department

Bộ phận Tọa độ x Tọa độ y

A 0 3
B 9 2
C 1 6
D 5 4
E 3 3
F 7 4
G 8 2
H 9 9 37

K 6 6
BÀI TOÁN VỊ TRÍ CHO N THIẾT BỊ/NHÀ
MÁY
 How can we define more the one machine/ department
 Objective function

min f(x) = total distribution cost (the sum of

transportation cost between new machine + the sum of
transportation cost between new machine and current
machine )

Location of new machine/department

Location of current machine/department
Transportation cost of 1/unit form j to
38
Transportation cost of 1/unit form j to i
Distance from j to k
Distance from j và i
 Rectilinear:

 (Euclidean)

39
BÀI TOÁN VỊ TRÍ CHO N THIẾT BỊ/NHÀ
MÁY
VÍ DỤ
 We want to locate 2 new machine to support three
current machine A=(1,5), B=(4,10) và C=(10,3). The
flow of machine has been listed below
 Build the objective function based on Rectilinear
distance

40
41
BÀI TOÁN VỊ TRÍ CHO N THIẾT BỊ/NHÀ
MÁY
VÍ DỤ
 Mô hình LINGO – khoảng cách vuông góc

 Kết quả:

42
43
4. MACHINE LAYOUT MODELS
XPi =(xj,yj): Location of pickup point of machine i, i = 1, 2, …, n
XDi =(ai, bi): Location of delivery point of machine i
wi : width of machine i oriented parallel to the aisle
aij: minimum clearance between machine i and j
cij: cost per trip per unit distance from machine i to j
fLij = total loaded material handling trips from machine i to machine j
fEij = total empty (deadhead) material handling trips from machine i to machine j
- The single-row model formulation is as follows

The objective function gives the total cost of material handling where

Subject to

j = i +1, …, n for loaded trips

j = i +1, …, n for (empty) deadhead trips

• Procedure for the Relative Placement Cost - RPC
 EXAMPLE 10.22
LOCATION FOUR MACHINES ALONG ONE SIDE OF AN AISLE
Consider the problem of locating 4 machines along an aisle. There are a total of 4! = 24 ways of
arranging these 4 machines. Let cij = 1 and aij = 1. The distance is caculated base on eclidean
distance according to the centroid of each machine . The machines dimensions are

The loaded material handling trips between machines are

 For placement order 241

For placement order 324

For placement order 243

Since the minimum relative placement cost (RPC) is 156.5, we select the order
124
EXERCISES

Optimal order ?

48
PLANT LOCATION, FACTORS AFFECTING
PLANT LOCATION
 https://www.youtube.com/watch?v=OshyCwH3TJM

49
50