Professional Documents
Culture Documents
Upply Network Design: Source: Getty Images
Upply Network Design: Source: Getty Images
Slack, Chambers and Johnston, Operations Management 5 th Edition © Nigel Slack, Stuart Chambers, and Robert Johnston 2007
Supply network design
Slack, Chambers and Johnston, Operations Management 5 th Edition © Nigel Slack, Stuart Chambers, and Robert Johnston 2007
Case Study: Dell
Michael Dell started in 1984 by cutting out the ‘middle man’ and
delivering computers direct to the customer
Using its direct selling methods, Dell went on to become the number
one computer maker
There are many reasons for Dell’s success but most of them come
from the way Dell configures its supply networks
Slack, Chambers and Johnston, Operations Management 5 th Edition © Nigel Slack, Stuart Chambers, and Robert Johnston 2007
Operations network for a plastic homeware company
Chemical Wholesaler
company Plastic Retailer
stockist
Cardboard Plastic
company homeware
manufacturer Retailer
Packaging
Ink
supplier
supplier
Direct supply
Information
Slack, Chambers and Johnston, Operations Management 5 th Edition © Nigel Slack, Stuart Chambers, and Robert Johnston 2007
Operations network for a shopping mall
Recruitment
agency Security
services
Cleaning
materials Cleaning Shopping Retailers Retail
supplier services mall customers
Equipment Maintenance
supplier services
Direct supply
Information
Slack, Chambers and Johnston, Operations Management 5 th Edition © Nigel Slack, Stuart Chambers, and Robert Johnston 2007
Operations performance should be seen
as a whole supply chain issue
Slack, Chambers and Johnston, Operations Management 5 th Edition © Nigel Slack, Stuart Chambers, and Robert Johnston 2007
Case Study
• Lizard wear
Slack, Chambers and Johnston, Operations Management 5 th Edition © Nigel Slack, Stuart Chambers, and Robert Johnston 2007
Design Decisions in supply networks
Slack, Chambers and Johnston, Operations Management 5 th Edition © Nigel Slack, Stuart Chambers, and Robert Johnston 2007
Configuring the Shape of Supply
Network
• Disintermediation
• Co-opetition
Slack, Chambers and Johnston, Operations Management 5 th Edition © Nigel Slack, Stuart Chambers, and Robert Johnston 2007
Direction, extent and balance of vertical integration
Raw
material Component Assembly Wholesaler Retailer
suppliers maker operation
Direction – Direction –
Upstream vertical Downstream vertical
integration integration
Slack, Chambers and Johnston, Operations Management 5 th Edition © Nigel Slack, Stuart Chambers, and Robert Johnston 2007
The decision logic of outsourcing
Slack, Chambers and Johnston, Operations Management 5 th Edition © Nigel Slack, Stuart Chambers, and Robert Johnston 2007
The Location of Capacity
Slack, Chambers and Johnston, Operations Management 5 th Edition © Nigel Slack, Stuart Chambers, and Robert Johnston 2007
Supply-side and demand-side factors
in location decisions
Slack, Chambers and Johnston, Operations Management 5 th Edition © Nigel Slack, Stuart Chambers, and Robert Johnston 2007
Location Techniques
• Weighted-Score method
• Centre of Gravity method
Slack, Chambers and Johnston, Operations Management 5 th Edition © Nigel Slack, Stuart Chambers, and Robert Johnston 2007
Weighted-Score method
Slack, Chambers and Johnston, Operations Management 5 th Edition © Nigel Slack, Stuart Chambers, and Robert Johnston 2007
Plant Location Methodology:
Location Factor Rating
Procedures Scores(0 to100)
1. Identify factors that are LocationFactors Weight Site 1 Site 2 Site 3
important in the location Labor pool &climate 0.30 80 65 95
decision Proximitytosupplies 0.20 100 91 75
2. Prioritize the factor by its Wage rates 0.15 60 95 80
importance. Each factor is Communityenvironment 0.15 75 80 80
weighted from 0 to 1.00
Scores(0 to100)
3. Subjective score (0 to 100) is
LocationFactors Site 1 Site 2 Site 3
assigned to each site for each
factor Labor pool &climate 24.00 19.50 28.50
Slack, Chambers and Johnston, Operations Management 5 th Edition © Nigel Slack, Stuart Chambers, and Robert Johnston 2007
Example
(x1,y1) d1
• Customer Location Demand Customer Location Demand
• 1 (151,264) 1.1 6 (146,246) 0.4
• 2 (159,261) 0.7 7 (161,242) 0.8
• 3 (130,254) 0.8 8 (142,239) 0.1
• 4 (128,252) 1.4 9 (163,236) 0.5
• 5 (163,247) 2.1 10 (148,232) 0.6
• F ( xF , yF )
10
Objective: minimise d x
i 1
i i xF 2 yi yF 2
Euclidean distance metric
Slack, Chambers and Johnston, Operations Management 5 th Edition © Nigel Slack, Stuart Chambers, and Robert Johnston 2007
270
265
260
255
250
245
240
235
230
120 140 160 180
Slack, Chambers and Johnston, Operations Management 5 th Edition © Nigel Slack, Stuart Chambers, and Robert Johnston 2007
Centre of gravity: initial solution
Initial solution
x 0 (
j
d j x j ) /(
j
dj) y 0 (
j
d j y j ) /(
j
dj)
Iterative improvements
x n1 (
j
d j x j / w nj ) /(
j
d j / w nj ) y n1 (
j
d j y j / w nj ) /(
j
d j / w nj )
n
where w j is the distance from the nth location to customer j
Slack, Chambers and Johnston, Operations Management 5 th Edition © Nigel Slack, Stuart Chambers, and Robert Johnston 2007
The iteration results
x y ton-miles
Slack, Chambers and Johnston, Operations Management 5 th Edition © Nigel Slack, Stuart Chambers, and Robert Johnston 2007
Problem Description
• A fire station can be placed in any
neighborhood. It is able to handle the fires for
both its neighborhood and any adjacent
neighborhood (any neighborhood with a non-
zero border with its home neighborhood).
• The objective is to minimize the number of fire
stations used.
Slack, Chambers and Johnston, Operations Management 5 th Edition © Nigel Slack, Stuart Chambers, and Robert Johnston 2007
Problem Formulation (by using
Linear Programming)
• We can create one variable for each neighborhood j. This variable will be 1 if we
place a station in the neighborhood, and will be 0 otherwise. This leads to the
following formulation
Slack, Chambers and Johnston, Operations Management 5 th Edition © Nigel Slack, Stuart Chambers, and Robert Johnston 2007
Set Covering Problem Solution
• The first constraint states that there must be a station either in neighborhood 1 or in
some adjacent neighborhood. The next constraint is for neighborhood 2 and so on.
Notice that the constraint coefficient is 1 if neighborhood i is adjacent to
neighborhood j or if i=j and 0 otherwise. The jth column of the constraint matrix
represents the set of neighborhoods that can be served by a fire station in
neighborhood j. We are asked to find a set of such subsets j that covers the set of all
neighborhoods in the sense that every neighborhood appears in the service subset
associated with at least one fire station.
• One optimal solution to this is and the rest equal to 0.
• This is an example of the set covering problem. The set covering problem is
characterized by having binary variables, constraints each with a right hand side of
1, and having simply sums of variables as constraints. In general, the objective
function can have any coefficients, though here it is of a particularly simple form.
Slack, Chambers and Johnston, Operations Management 5 th Edition © Nigel Slack, Stuart Chambers, and Robert Johnston 2007
Long-Term Capacity management
Slack, Chambers and Johnston, Operations Management 5 th Edition © Nigel Slack, Stuart Chambers, and Robert Johnston 2007
The balance of capacity
Slack, Chambers and Johnston, Operations Management 5 th Edition © Nigel Slack, Stuart Chambers, and Robert Johnston 2007
Unit cost curves for individual service centres of
varying capacities
Real cost per customer served Cost curve for 5
bay service centre
Cost curve for 10
Cost curve for 15
bay service centre bay service centre
‘Economy of scale’
curve for hotel
Economies Diseconomies
capacity
of scale of scale
5 10 15
Average number of bays in use
Slack, Chambers and Johnston, Operations Management 5 th Edition © Nigel Slack, Stuart Chambers, and Robert Johnston 2007
Capacity leading demand and capacity lagging demand
Capacity
Volume
Volume
Demand Demand
Capacity
Time Time
Slack, Chambers and Johnston, Operations Management 5 th Edition © Nigel Slack, Stuart Chambers, and Robert Johnston 2007
Smoothing with inventory
Capacity
Volume
Demand
Time
Slack, Chambers and Johnston, Operations Management 5 th Edition © Nigel Slack, Stuart Chambers, and Robert Johnston 2007