Professional Documents
Culture Documents
Importance of Facility
Facility Location decisions are part of the companys strategy. Infrequent
Location
but expensive.
The facility location decisions affect not only costs but the companys
income:
All areas of the company are affected by Facility Location: Operations, but also
Business Development, Human Resources, Finance, etc.
Land costs.
Labor costs.
Raw materials.
Transportation and distribution
Topics
Centroid Methods
Factors Rating Analysis.
Economic Analysis.
Transportation (Mathematical Programming Methods).
Set Covering.
Location Alternatives
Topics
Centroid Methods
Factors Rating Analysis.
Economic Analysis.
Transportation (Mathematical Programming Methods).
Set Covering.
Proximity to Customers
Business Climate
Total Costs
Infraestructure
Quality of Labor
Suppliers
Other Facilities
Political Risks
Government Barriers
Trading Blocks
Environmental Regulation
Host Community
Competitive Advantage
Topics
Centroid Methods
Factors Rating Analysis.
Economic Analysis.
Transportation (Mathematical Programming Methods).
Set Covering.
Competitive STRATEGY
INTERNAL CONSTRAINTS
Capital, growth strategy,
existing network
PRODUCTION TECHNOLOGIES
Cost, Scale/Scope impact, support
required, flexibility
COMPETITIVE
ENVIRONMENT
GLOBAL COMPETITION
PHASE I
Supply Chain
Strategy
PHASE II
Regional Facility
Configuration
REGIONAL DEMAND
Size, growth, homogeneity,
local specifications
POLITICAL, EXCHANGE
RATE AND DEMAND RISK
PHASE III
Desirable Sites
PRODUCTION METHODS
Skill needs, response time
FACTOR COSTS
Labor, materials, site specific
PHASE IV
Location Choices
AVAILABLE
INFRASTRUCTURE
LOGISTICS COSTS
Transport, inventory, coordination
Levels of Decisions.
Market Region
Market Potential
Market Share
Operating Cost
Subregion
Community
Access to market/materials
Material Cost
Labor Cost and Availability
Taxes
Availability of public services
Availabilty of sites
Community amenities
Sites
Topics
Centroid Methods
Factors Rating Analysis.
Economic Analysis.
Transportation (Mathematical Programming Methods).
Set Covering.
J.I.T. Systems.
Topics
Centroid Methods
Factors Rating Analysis.
Economic Analysis.
Transportation (Mathematical Programming Methods).
Set Covering.
Local FG
Mix
Regional FG
Local WIP
Cost
Central FG
Central WIP
Central Raw Material and Custom production
Low
Low
Response Time
Hi
Clientes
Centro
distribucin
Clientes
Centro
distribucin
Clientes
Centro
distribucin
Clientes
Centro
distribucin
Customer
DC
Response
Time
Number of Facilities
Total Costs
Cost of Operations
Percent Service
Level Within
Promised Time
Facilities
Inventory
Transportation
Labor
Number of Facilities
Topics
Centroid Methods
Factors Rating Analysis.
Economic Analysis.
Transportation (Mathematical Programming Methods).
Set Covering.
No limitation of facilities.
Limitation of facilities.
Centroid Method
N/S
150
120
90
1.000
1.000
2.000
60
30
2.000
30
60
Origen arbitrario
Cx =
d V
V
ix
Cy =
d V
V
iy
90
120
150
E/O
Cx , Cy = Gravity Center
dix , diy = coordinates de la ubicacin i
Vi
= Volume of goods moved from/to i
No limitation of facilities.
Limitation of facilities.
Factor-Rating Method
Factor-Rating Example
Critical
Success
Factor
Labor
availability
and attitude
People-to
car ratio
Per capita
income
Tax structure
Education
and health
Totals
Weight
Scores
(out of 100)
France Denmark
Weighted Scores
France
Denmark
.25
70
60
.05
50
60
.10
.39
85
75
80
70
.21
60
70
1.00
70.4
(.05)(60) = 3.0
68.0
Table 8.3
No limitation of facilities.
Limitation of facilities.
Fixed Variable
City
Cost
Cost
Akron
$30,000
$75
Bowling Green
$60,000
$45
Chicago
$110,000
$25
Selling price = $120
Expected volume = 2,000 units
Total
Cost
$180,000
$150,000
$160,000
Annual cost
$180,000
$160,000
$150,000
urve
c
t
c os
$130,000
o
g
a
ic
Ch
$110,000
en
e
r
g G rve
n
i
l
u
owost c
B
$80,000
c st
co
$60,000 ron ve
r
Ak cu
Akron
$30,000
Bowling Green
lowest
lowest cost
cost
$10,000
|
|
|
|
|
0
500
1,000
1,500
2,000
Volume
Chicago
lowest
cost
|
2,500
3,000
No limitation of facilities.
Limitation of facilities.
Network Optimization
Models
Conventional
Network
Vendor
DC
Vendor
DC
Materials
DC
Finished
Goods DC
Customer
DC
Customer
Store
Component
Manufacturing
Customer
DC
Plant
Warehouse
Components
DC
Vendor
DC
Final
Assembly
Customer
Store
Finished
Goods DC
Customer
Store
Customer
Store
Customer
DC
Customer
Store
n m
s.t.
n
xij D j
i 1
m
xij K i
j 1
xij 0
yi = 1 if plant is located
at site i, 0 otherwise
xij = Quantity shipped
from plant site i to
customer j
n m
i 1
i 1 j 1
xij D j
i 1
n
xij K i y i
j 1
m
y i k ; y i {0,1}
i 1
Multi-echelon
Regional
Finished
Goods DC
National
Finished
Goods DC
Regional
Finished
Goods DC
Local DC
Cross-Dock
Local DC
Cross-Dock
Local DC
Cross-Dock
Store 1
Customer 1
DC
Customer 2
DC
Store 1
Store 2
Store 2
Store 3
Store 3
No limitation of facilities.
Limitation of facilities.
xj =
{
{
1
0
1
0
Minimize
c
j 1
xj
s.t.
n
a
j 1
i, j
x j 1,
x j 0,1 ,
i 1..n
j 1..n
Step 2:
Step 3:
Step 4
Example:
A rural country administration wants to locate several
medical emergency response units so that it can
respond to calls within the county within eight minutes
of the call. The county is divided into seven population
zones. The distance between the centers of each pair
of zones is known and is given in the matrix below.
Imagine that the one that has to make the decision
does not want to place a emergency unit on B or D
Example:
[dij]=
1
2
3
4
5
6
7
1
0
8
50
9
50
30
8
2
4
0
13
11
8
5
5
3
12
15
0
8
4
7
9
4
6
60
8
0
10
9
7
5
15
7
6
9
0
3
25
6
10
2
5
10
2
0
27
7
8
3
9
3
27
27
0
Example 4:
The response units can be located in the center of population zones 1
through 7 at a cost (in hundreds of thousands of dollars) of 100, 80,
120 110, 90, 90, and 110 respectively. Assuming the average travel
speed during an emergency to be 60 miles per hour, formulate an
appropriate set covering model to determine where the units are to be
located and how the population zones are to be covered and solve the
model using the greedy heuristic.
Solution:
Defining
aij =
1
0
and noting that dij > 8, dij <= 8 would yield aij values of 0, 1,
respectively the following [aij] matrix can be set up.
Solution:
Minimize Subject to:
100x1+80x2+120x3+110x4+90x5+90x6+110x7
x1 +
x2 +
x4 +
x1 +
x2 +
x5
x3 +
x4 +
x5
x1
x1
+
,
x2
x2
+
+
x2
x2
+
,
x3
x3
x3
+
+
x3
x4
x6
x6
+
x5
x5
x4
x4
+
+
+
,
x5
+
+
,
x7
x7
=1
=1
=1
x7
=1
=1
x6
x6
x6
=1
,
x7
x7
=1
{0,1}
Greedy Heuristic
Step 1: Since each cj > 0, j = 1, 2, ..., 7,
go to step 2.
Step 2: Since xj appears in each
constraint with a +1 coefficient, go
to step 3.
Greedy Heuristic
Step 3:
c1
d
1
c2
d
2
c3
d
3
c4
d
4
100
=
= 33.3
3
=
8
05
120
= 3
5
0
110
= 27.5
4
= 1
6
c5
90
=
= 22.5
d
4
5
c6
9
=
= 22.5
d
04
6
c7
110
=
= 27.5
d
4
7
Greedy Heuristic
Since the minimum ck/dk occurs for k = 2, set x2 = 1 and
remove the first two and the last three constraints.
The resulting model is shown below.
Minimize Subject to:
100x1+120x3+110x4+90x5+90x6+110x7
x3 + x4 + x5 + x6
=1
x3 + x4 +
x7 =1
x1
,
x3 ,
x4 ,
x5 ,
x6 ,
x7 {0,1}
Greedy Heuristic:
Step 4: Since we have two constraints go to step 1.
Step 1: Since c1 > 0, j = 1, 3, 4, ..., 7, go to step 2
Step 2: Since c1 > 0 and x1 does not appear in any of
the constraints with a +1 coefficient, set x1 = 0.
Greedy Heuristic
Step 3:
c3
d3
c4
d4
c5
d5
c6
d6
120
2
110
2
90
1
90
1
60
55
90
90
c7
d7
110
1
110
Greedy Heuristic
Since the minimum ck/dk occurs for k = 4, set x4 = 1 and
remove both constraints in the above model since x4
has a +1 coefficient in each. The resulting model is
shown below.
Minimize Subject to:
120x3+90x5+90x6+110x7
x3 , x5 , x6 , x7
=0
Greedy Heuristic:
Step 4: