ASSIGNMENT PROBLEM
A certain class of Transportation Problem
It is a balanced transportation problem in which all
supplies and demands are equal to 1
It is characterized by knowledge of the cost of assigning
each supply point to each demand point
The assignment problem is a special type of linear
programming problem where assignees/agents are
being assigned to perform tasks
In an assignment problem, each agent is assigned to its
own best task
To fit the definition of an assignment problem, these kinds
of applications need to be formulated in a way that
satisfies the following assumptions.
1. The number of assignees and the number of tasks are
the same. (This number is denoted by n.)
2. Each assignee is to be assigned to exactly one task.
3. Each task is to be performed by exactly one assignee.
4. There is a cost cij associated with assignee i (i 1, 2, . . .
, n) performing task j ( j 1, 2, . . . , n).
5. The objective is to determine how all n assignments
should be made to minimize the total cost.
General Formulation of Assignment Problem
i m j n
Min
i1
c X
j1
ij ij
s.t
j n
X
j1
ij
1(i 1,2,........m)
i m
X
i1
ij
1( j 1,2,.....n)
X ij
0(i 1,2,.....m; j 1,2,....n)
X ij
1(i 1,2,.....m; j 1,2,....n)
ASSIGNMENT PROBLEM—INDUSTRY MACHINE ALLOCATION
An industry has four machines and four jobs to be completed.
Each machine must be assigned to complete one job.
The time required to set up each machine for completing each
job is given here under:
Job1 Job2 Job3 Job4
Machine1 14 5 8 7
Machine2 2 12 6 5
Machine3 7 8 3 9
Machine4 2 4 6 10
Minimize the total set up time needed to complete the four jobs.
ASSIGNMENT PROBLEM OPTIMAL INDUSTRY MACHINE ALLOCATION
ASSIGNMENT PROBLEM
Job 1 Job 2 Job 3 Job 4 COST
Machine 1 14 5 8 7 15
Machine 2 2 12 6 5
Machine 3 7 8 3 9
Machine 4 2 4 6 10
Job 1 Job 2 Job 3 Job 4 LHS CAPACITY
Machine 1 0 1 0 0 1 1
Machine 2 0 0 0 1 1 1
Machine 3 0 0 1 0 1 1
Machine 4 1 0 0 0 1 1
LHS 1 1 1 1
DEMAND 1 1 1 1
ASSIGNMENT PROBLEM—BID EVALUATION
A company is taking bids on four construction jobs.
Three people have placed bids on the jobs.
Their bid in million rupees are given here under:
Job1 Job2 Job3 Job4
Person1 50 46 42 40
Person2 51 48 44
Person3 47 45 45
Person 1 can do only one job, but person 2 and person 3 can do
up to two jobs.
Determine the minimum cost assignment of persons to jobs.
ASSIGNMENT PROBLEM—OPTIMAL BID EVALUATION
ASSIGNMENT PROBLEM
Job 1 Job 2 Job 3 Job 4 COST
Person 1 50 46 42 40 182
Person 2 51 48 44
Person 3 47 45 45
Job 1 Job 2 Job 3 Job 4 LHS CAPACITY
Person 1 0 0 0 1 1 1
Person 2 1 0 1 2 2
Person 3 1 0 0 1 2
LHS 1 1 1 1
DEMAND 1 1 1 1
TRANSSHIPMENT PROBLEM
In Transportation Problem, we considered
shipment go from a supply point to demand
point.
Shipments are allowed between supply points or
between demand points.
It is characterized by knowledge of the cost of
assigning each supply point to each demand
point
Linear Programming: The
Transshipment Problem
Transshipment Problem
A network model is one which can be
represented by a set of nodes, a set of
arcs, and functions (e.g. costs, supplies,
demands, etc.) associated with the arcs
and/or nodes.
Transshipment Problem is an example
of a network problem.
Transshipment Problem
Transshipment problems are
transportation problems in which a
shipment may move through intermediate
nodes (transshipment nodes) before
reaching a particular destination node.
Transshipment problems can be converted
to larger transportation problems and
solved by a special transportation
program.
Transshipment Problem
Transshipment problems can also be
solved by general purpose linear
programming codes.
The network representation for a
transshipment problem with two sources,
three intermediate nodes, and two
destinations is shown on the next slide.
Transshipment Problem
Network Representation
c36
3
c13 c37
s1 1 c14 6 d1
c15 c46
4 c47
c23 c24
c56 7 d2
s2 2
c25
5 c57
SOURCES INTERMEDIATE DESTINATIONS
NODES
Transshipment Problem
Linear Programming Formulation
xij represents the shipment from node i to node j
Min SScijxij
ij
s.t. Sxij < si for each source (origin) i
j
Sxik - Sxkj = 0 for each intermediate
i j node k (conservation of flow)
Sxij > dj for each destination j
i
xij > 0 for all i and j (nonnegativity)
Example 1: Thomas & Washburn
Thomas Industries and Washburn
Corporation supply three firms (Zrox, Hewes,
Rockwright) with customized shelving for its
offices. They both order shelving from the same
two manufacturers, Arnold Manufacturers and
Supershelf, Inc.
Currently weekly demands by the users are
50 for Zrox, 60 for Hewes, and 40 for
Rockwright. Both Arnold and Supershelf can
supply at most 75 units to its customers.
Additional data is shown on the next slide.
Example 1: Thomas &
Washburn
Because of long standing contracts based on past orders, unit costs
from the manufacturers to the suppliers are:
Thomas Washburn
Arnold 5 8
Supershelf 7 4
The cost to install the shelving at the various locations are:
Zrox Hewes Rockwright
Thomas 1 5 8
Washburn 3 4 4
Find the quantities to be shipped from each source to each
destination to minimize the total shipping cost.
Example 1: Thomas & Washburn
5
Network Representation ZROX
Zrox +50
1 3
5 1
ARNOLD
-75 Arnold Thomas 5
6
8 8
Hewes
HEWES +60
2 4
3 4
7
-75 Super Wash-
WASH 7
Shelf Burn
BURN
4 4
Rock-
Supply nodes Transshipment Wright +40
nodes
Demand nodes
Example 1: Thomas &
Washburn
Linear Programming Formulation
Decision Variables Defined
xij = amount shipped from manufacturer i to supplier j
xjk = amount shipped from supplier j to customer k
where i = 1 (Arnold), 2 (Supershelf)
j = 3 (Thomas), 4 (Washburn)
k = 5 (Zrox), 6 (Hewes), 7 (Rockwright)
Objective Function Defined
Minimize Overall Shipping Costs:
Min 5x13 + 8x14 + 7x23 + 4x24 + 1x35 + 5x36 + 8x37
+ 3x45 + 4x46 + 4x47
Example 1: Thomas &
Washburn
Constraints Defined
Amount Out of Arnold: x13 + x14 < 75
Amount Out of Supershelf: x23 + x24 < 75
Amount Through Thomas: x13 + x23 - x35 - x36 - x37 = 0
Amount Through Washburn: x14 + x24 - x45 - x46 - x47 = 0
Amount Into Zrox: x35 + x45 > 50
Amount Into Hewes: x36 + x46 > 60
Amount Into Rockwright: x37 + x47 > 40
Non-negativity of Variables: xij > 0, for all i and j.
Example 1: Thomas & Washburn problem via LP
The solver formulation is:
Ship From To Unit Cost
0 1 Arnold 3 Thomas $5
0 1 Arnold 4 Washburn $8
0 2 SuperShelf 3 Thomas $7
0 2 SuperShelf 4 Washburn $4
0 3 Thomas 5 Zrox $1
0 3 Thomas 6 Hewes $5
0 3 Thomas 7 Rock-Wright $8
0 4 Washburn 5 Zrox $3
0 4 Washburn 6 Hewes $4
0 4 Washburn 7 Rock-Wright $4
Total Transportation Cost $0
Net Flow Supply/Demand
0 -75
0 -75
0 0
0 0
0 50
0 60
0 40
Total Transportation Cost $0
Example 1: Thomas & Washburn problem via LP
The solver solution is:
The Transshipment Problem
Ship From To Unit Cost
75 1 Arnold 3 Thomas $5
0 1 Arnold 4 Washburn $8
0 2 SuperShelf 3 Thomas $7
75 2 SuperShelf 4 Washburn $4
50 3 Thomas 5 Zrox $1
25 3 Thomas 6 Hewes $5
0 3 Thomas 7 Rock-Wright $8
0 4 Washburn 5 Zrox $3
35 4 Washburn 6 Hewes $4
40 4 Washburn 7 Rock-Wright $4
Supply (-) or
Nodes Net Flow Demand (+)
1 Arnold -75 -75
2 SuperShelf -75 -75
3 Thomas 0 0
4 Washburn 0 0
5 Zrox 50 50
6 Hewes 60 60
7 Rock-Wright 40 40
Total Transportation Cost $1,150
Example 2: The Bavarian Motors
Company (BMC)
BMC manufactures (very) expensive sports luxury cars in Germany and
ships them for sale in the US to Newark and Jacksonville. From
these entry ports the cars can be transported to distributors located
in Boston, Columbus, Atlanta, Richmond and Mobile. There are 200
cars available for shipment in Newark and 300 in Jacksonville. The
distributors ordered the following quantities of cars:
Boston: 100
Columbus: 60
Atlanta: 170
Richmond: 80
Mobile: 70.
The shipping costs per unit for are shown in the next slide. You are
retained (for a large consulting fee) to determine shipping quantities
to minimize the total shipping cost.
Example 2: The Bavarian Motors
From
Company
1 Newark
To
(BMC)
2 Boston
Unit Cost
$30
1 Newark 4 Richmond $40
2 Boston 3 Columbus $50
3 Columbus 5 Atlanta $35
5 Atlanta 3 Columbus $40
5 Atlanta 4 Richmond $30
5 Atlanta 6 Mobile $35
6 Mobile 5 Atlanta $25
7 Jacksonville 4 Richmond $50
7 Jacksonville 5 Atlanta $45
7 Jacksonville 6 Mobile $50
Example 2: The Bavarian Motors
Company$45(BMC)$40 ZROX
Richmond
(4)
80
Network Representation $50
$50 $30
Newark
ARNOLD $30 Boston
200 (1) (2)
100
Atlanta
$35 HEWES
(5) 170
$50
$25
Jacksonville Columbus
300 (7)
WASH
(3)
$40 $35
BURN
Mobile
60 $50 70
Supply nodes (6)
Example 2: The Bavarian Motors
Company (BMC)
Linear Programming Formulation:
Decision Variables Defined
xij = amount shipped from source i to destination j
(i, j = 1 through 7)
Objective Function Defined
Minimize Overall Shipping Costs:
Min 30x12 + 40x14 + 50x23 + + 50x24 +35x35 +
40x53 + 30x54 + 35x56 + 25x65 + 50x74 + 45x75+ 50x76
Example 2: The Bavarian Motors Company (BMC)
Constraints Defined
Flow constraint for node 1: -x12 - x14 > -200
Flow constraint for node 2: x12 - x23 - x24> 100
Flow constraint for node 3: x23 +x53 - x35 > 60
Flow constraint for node 4: x14 + x24 + x54 + x74 > 80
Flow constraint for node 5:
x35 + x65 + x75 - x53 - x54 - x56 > 170
Flow constraint for node 6: x56 + x76 - x65 > 70
Flow constraint for node 7: -x74 - x75 - x76 > -300
Non-negativity of variables: xij > 0, for all i and j.
Example 2: The Bavarian Motors
Company (BMC)
The solver formulation is:
Bavarian Motor Company
Ship From To Unit Cost Nodes Net Flow Supply/Demand
0 1 Newark 2 Boston $30 1 Newark 0 -200
0 1 Newark 4 Richmond $40 2 Boston 0 100
0 2 Boston 3 Columbus $50 3 Columbus 0 60
0 3 Columbus 5 Atlanta $35 4 Richmond 0 80
0 5 Atlanta 3 Columbus $40 5 Atlanta 0 170
0 5 Atlanta 4 Richmond $30 6 Mobile 0 70
0 5 Atlanta 6 Mobile $35 7 Jacksonville 0 -300
0 6 Mobile 5 Atlanta $25
0 7 Jacksonville 4 Richmond $50
0 7 Jacksonville 5 Atlanta $45
0 7 Jacksonville 6 Mobile $50
Total Transportation Cost $0
Example 2: The Bavarian Motors
Company (BMC)
The solver solution is:
Bavarian Motor Company
Ship From To Unit Cost Nodes Net Flow Supply/Demand
120 1 Newark 2 Boston $30 1 Newark -200 -200
80 1 Newark 4 Richmond $40 2 Boston 100 100
20 2 Boston 3 Columbus $50 3 Columbus 60 60
0 3 Columbus 5 Atlanta $35 4 Richmond 80 80
40 5 Atlanta 3 Columbus $40 5 Atlanta 170 170
0 5 Atlanta 4 Richmond $30 6 Mobile 70 70
0 5 Atlanta 6 Mobile $35 7 Jacksonville -280 -300
0 6 Mobile 5 Atlanta $25
0 7 Jacksonville 4 Richmond $50
210 7 Jacksonville 5 Atlanta $45
70 7 Jacksonville 6 Mobile $50
Total Transportation Cost $22,350
Transshipment Problem
The manager of a Sand and Gravel Pit has decided to utilize two
intermediate nodes as transshipment points for temporary storage of
topsoil.
Table 6–2 Cost of Shipping One Unit from the Farms to Warehouses
Farm Capacity in Mton
100
200
200
Table 6–2 Cost of Shipping One Unit from the Warehouses to Projects
Project Demand in Mton 50 150 300
A Network Diagram of
Sand and Gravel Pit
Transshipment Example
The diagram of the transshipment problem is given.
