Assignment problem

Assignment problem is one of the special cases of transportation problems. The goal of the assignment
problem is to minimize the cost or time of completing a number of jobs by a number of persons. An
important characteristic of the assignment problem is the number of sources is equal to the number of
destinations.It is explained in the following way.

1. Only one job is assigned to person.

2. Each person is assigned with exactly one job.

Management has faced with problems whose structures are identical with assignment problems.

Ex: A manager has five persons for five separate jobs and the cost of assigning each job to each person
is given. His goal is to assign one and only job to each person in such a way that the total cost of
assignment is minimized.

Types of Assignment Problems

 Balanced assignment problem: This is an assignment where the number of persons is equal to
the number of jobs.
 Unbalanced assignment problem: This is the case of assignment problem where the number
of persons is not equal to the number of jobs. A dummy variable, either for a person or job (as it
required) is introduced with zero cost or time to make it a balanced one.
 Maximization Problem: There are problems where certain facilities have to be assigned to a
number of jobs so as to maximize the overall performance of the assignment. The problem can
be converted into a minimization problem in the following ways and then Hungarian method
can be used for its solution.
 Select the highest element in the entire assignment table and subtract all the elements of the
table from the highest element.
 Change the signs of all values given in the table.

Mathematical Model
Solution of Assignment Problem
The assignment problem can be solved by the following four methods:
a) Complete enumeration method
b) Simplex Method
c) Transportation method
d) Hungarian method
Hungarian method
Step 1:In a given problem, if the number of rows is not equal to the number of columns and vice versa,
then add a dummy row or a dummy column. The assignment costs for dummy cells are always
assigned as zero.
Step 2: Reduce the matrix by selecting the smallest element in each row and subtract with other
elements in that row.
Step 3: Reduce the new matrix column-wise using the same method as given in step 2.
Step 4:Draw the minimum number of horizontal and vertical lines through appropriate rows and
columns so that all the zero entries of the cost matrix are covered.
Step 5: If Number of lines drawn = order of matrix, then optimally is reached, so proceed to step 7. If
optimally is not reached, then go to step 6.
Step 6: Select the smallest element of the whole matrix, which is NOT COVERED by lines. Subtract
this smallest element with all other remaining elements that are NOT COVERED by lines and add the
element at the intersection of lines. Leave the elements covered by single line as it is. Now go to step 4.
Step 7: Take any row or column which has a single zero and assign by squaring it. Strike off the
remaining zeros, if any, in that row and column (X). Repeat the process until all the assignments have
been made.
Note: While assigning, if there is no single zero exists in the row or column, choose any one zero and
assign it. Strike off the remaining zeros in that column or row and repeat the same for other
assignments also. If there is no single zero allocation, it means multiple numbers of solutions exist. But
the cost will remain the same for different sets of allocations.
Step 8: Write down the assignment results and find the minimum cost/time.
Problems
1. A plant manager has four subordinates, and four tasks to be performed. The subordinates differ in
efficiency and the tasks differ in their intrinsic difficulty. This estimate of the times each man would
take to perform each task is given in the effectiveness matrix below.
I II III IV
A 8 26 17 11
B 13 28 4 26
C 38 19 18 15
D 19 26 24 10
How should the tasks be allocated, one to a man, so as to minimize the total man hours?

Solution:: it is balanced assignment problem (4=4)

Step1: Identify minimum element from each row and subtract it from the respective row
elements
I II III IV Row Minimum
A 8 26 17 11 8
B 13 28 4 26 4
C 38 19 18 15 15
D 19 26 24 10 10
Row Regret Table
I II III IV
A 0 18 9 3
B 9 24 0 22
C 23 4 3 0
D 9 16 14 0
Step2: Identify minimum element from each column and subtract it from the respective column
elements
I II II IV
I
A 0 18 9 3
B 9 24 0 22
C 23 4 3 0
D 9 16 1 0
4
Column 0 4 0 0
Minimum
Column regret table
I II III IV
A 0 14 9 3
B 9 20 0 22
C 23 0 3 0
D 9 12 14 0
Step3: Draw the minimum number of horizontal and vertical lines covers all zeros in the matrix
I II III IV
A 0 14 9 3
B 9 20 0 22
C 23 0 3 0
D 9 12 14 0
step4: Test for optimality
Number of lines = No. of rows or columns
4=4
Hence, optimal solution is reached
Step 6: Make the Assignment
I II III IV
A 0 14 9 3
B 9 20 0 22
C 23 0 3 0
D 9 12 14 0

I II III IV
A 8 26 17 11
B 13 28 4 26
C 38 19 18 15
D 19 26 24 10
Conclusion
Subordinates Tasks Man hours
A I 8
B III 4
C II 19
D IV 10
Total Minimum Man Hours = 41
2. A dairy plant has five milk tankers I, II, III, IV & V. These milk tankers are to be used on five
delivery routes A, B, C, D, and E. The distances (in kms) between dairy plant and the delivery routes
are given in the following distance matrix.
I II III IV V
A 160 130 175 190 200
B 135 120 130 160 175
C 140 110 155 170 185
D 50 50 80 80 110
E 55 35 70 80 105

How the milk tankers should be assigned to the chilling centers so as to minimize the distance
travelled?

Solution
No. of rows = No. of Columns
5=5
Hence, the given problem is balanced assignment problem
Step1: Identify minimum element from each row and subtract it from the respective row
elements
I II III IV V Row Minimum
A 160 130 175 190 200 130
B 135 120 130 160 175 120
C 140 110 155 170 185 110
D 50 50 80 80 110 50
E 55 35 70 80 105 35

Row regret table

I II III IV V
A 30 0 45 60 70
B 15 0 10 40 55
C 30 0 45 60 75
D 0 0 30 30 60
E 20 0 35 45 70
Step2: Identify minimum element from each column and subtract it from the respective column
elements
I II III IV V
 A 30 0 45 60 70
B 15 0 10 40 55
C 30 0 45 60 75
D 0 0 30 30 60
E 20 0 35 45 70
column 0 0 10 30 55
minimum
Column regret table
I II III IV V
A 30 0 35 30 15
B 15 0 0 10 0
C 30 0 35 30 20
D 0 0 20 0 5
E 20 0 25 15 15
Step3: Draw the minimum number of horizontal and vertical lines covers all zeros in the matrix
I II III IV V
A 30 0 35 30 15
B 15 0 0 10 0
C 30 0 35 30 20
D 0 0 20 0 5
E 20 0 25 15 15
No. of lines ≠ No. of rows/columns
3≠5
Hence, optimal solution is not reached.
Step5
Note:
 wherever there is a line those are comes under covered elements
 wherever there is a no line those are comes under uncovered elements
 the horizontal & vertical line joins those elements comes under intersection elements
identify minimum element in uncovered elements (i.e 15). Subtract minimum element from
uncovered and add it to intersection elements.
I II III IV V
A 15 0 20 15 0
B 15 15 0 10 0
C 15 0 20 15 5
 D 0 15 20 0 5
E 5 0 10 0 0

Draw the minimum number of horizontal and vertical lines covers all zeros in the matrix

I II III IV V
A 15 0 20 15 0
B 15 15 0 10 0
C 15 0 20 15 5
D 0 15 20 0 5
E 5 0 10 0 0

No. of lines = No. of rows/columns

5=5
Hence, optimal solution is reached.
Make the assignments
I II III IV V
A 15 0 20 15 0
B 15 15 0 10 0
C 15 0 20 15 5
D 0 15 20 0 5
E 5 0 10 0 0

I II III IV V
A 160 130 175 190 200
B 135 120 130 160 175
C 140 110 155 170 185
D 50 50 80 80 110
E 55 35 70 80 105

Conclusion
Chilling centers Milk Tankers Distance (kms)
A V 200
 B III 130
C II 110
D I 50
E IV 80
570

Total Minimum distance travelled milk tankers is 570km to various chilling centers.

1. Assign the four tasks to four operators. The assigning costs are given in Table.

2. Solve the following assignment problem shown in Table using Hungarian method. The matrix
entries are processing time of each man in hours.

Routing Problems/Travelling Salesman Problem

Just consider how a postman delivers the post to the addressee. He arranges all the letters in an order
and starts from the post office and goes from addressee to addressee and finally back to his post office.
If he does not arrange the posts in an order, he may have to travel a long distance to clear all the posts.
Similarly, a traveling salesman has to plan his visits.
A salesman, who wishes to travel through his territory visiting various cities, wishes to visit one city
only once and wants to come back to the city from where be started and then go to other cities one after
other. As he is a single person who has to visit various cities, mere Reduction Theorem Rules or
Hungarian approach would not help in arriving at optimum solution always. Hence, a modified solution
would be found out to arrive at an optimal solution.
Problems
1. A salesman stationed at city A has to decide his tour plan to visit cities B, C, D, E and back to cityA.
The order of his choice so that total distance traveled is minimum. No sub touring is permitted. He
cannot travel from city A to city A itself. The distance between cities in Kilometers is given below:
Cities A B C D E
A -- 10 25 25 10
B 1 -- 10 15 2
C 8 9 -- 20 10
D 14 10 24 -- 15
E 10 8 25 27 --
Solution:
No. of Rows= No. of Columns
5=5
The given problem is balanced travelling salesman problem.
Apply Hungarian Method

Row Subtraction
Cities A B C D E Row Minimum
A -- 10 25 25 10 10
B 1 -- 10 15 2 1
C 8 9 -- 20 10 8
D 14 10 24 -- 15 10
E 10 8 25 27 -- 8

Cities A B C D E
A -- 0 15 15 0
B 0 -- 9 14 1
 C 0 1 -- 12 2
D 4 0 14 -- 5
E 2 0 17 19 --

Column Subtraction
Cities A B C D E
A -- 0 15 15 0
B 0 -- 9 14 1
C 0 1 -- 12 2
D 4 0 14 -- 5
E 2 0 17 19 --
Column 0 0 9 12 0
Minimum

Cities A B C D E
A -- 0 6 3 0
B 0 -- 0 2 1
C 0 1 -- 0 2
D 4 0 5 -- 5
E 2 0 8 7 --
Draw the minimum number of horizontal and vertical lines to cover all zeros
Cities A B C D E
A -- 0 6 3 0
B 0 -- 0 2 1
C 0 1 -- 0 2
D 4 0 5 -- 5
E 2 0 8 7 --

No. of lines ≠No. of rows or columns

4≠5. Hence, optimal solution is not reached.
The minimum element from uncovered elements is 2. Subtract it from uncovered and add it to
intersection elements.
Cities A B C D E
A -- 2 6 3 0
 B 0 -- 0 2 1
C 0 3 -- 0 2
D 2 0 3 -- 3
E 0 0 6 5 --
Draw the minimum number of horizontal and vertical lines to cover all zeros
Cities A B C D E
A -- 2 6 3 0
B 0 -- 0 2 1
C 0 3 -- 0 2
D 2 0 3 -- 3
E 0 0 6 5 --
No. of lines = No. of rows or columns
5=5. Hence, optimal solution is reached.
Go for assignment
Cities A B C D E
A -- 2 6 3 0
B 0 -- 0 2 1
C 0 3 -- 0 2
D 2 0 3 -- 3
E 0 0 6 5 --
Sequence is A-E-A. This is not correct sequence because the salesman has not covered B, C, D & E
cities.
Try for another sequence. The next minimum element after Zero is ‘1’
Cities A B C D E
A -- 2 6 3 0
B 0 -- 0 2 1
C 0 3 -- 0 2
D 2 0 3 -- 3
E 0 0 6 5 --
A-C-D-B-E-A
25+20+10+2+10= 67KM
Try for another sequence. The next minimum element after ‘1’ is ‘2’
Cities A B C D E
 A -- 2 6 3 0
B 0 -- 0 2 1
C 0 3 -- 0 2
D 2 0 3 -- 3
E 0 0 6 5 --

Cities A B C D E
A -- 2 6 3 0
B 0 -- 0 2 1
C 0 3 -- 0 2
D 2 0 3 -- 3
E 0 0 6 5 --

Conclusion
The salesman will follow the A-B-C-D-E-A sequence to minimize the distance to cover all cities.
Minimum distance is 10+10+20+15+10=65kms

2. A travelling salesman has to visit 5 cities. He wishes to start form a particularcity visit each city once
and then return to his starting point. The travelling time (in hours) foreach city from a particular city is
given below:

What should be the sequence of visit of the salesman, so that the total travelled time is minimum.
Cities A B C D E
a ∞ 4 7 3 4
b 4 ∞ 6 3 4
c 7 6 ∞ 7 5
d 3 3 7 ∞ 7
e 4 4 5 7 ∞
Row subtraction
 Cities A B C D E
a ∞ 1 4 0 1
b 1 ∞ 3 0 1
c 2 1 ∞ 2 0
d 0 0 4 ∞ 4
e 0 0 1 3 ∞
Column subtraction
Cities A B C D E
a ∞ 1 3 0 1
b 1 ∞ 2 0 1
c 2 1 ∞ 2 0
d 0 0 3 ∞ 4
e 0 0 0 3 ∞

Draw the minimum number of horizontal and vertical lines to cover all zeros
Cities A B C D E
a ∞ 1 3 0 1
b 1 ∞ 2 0 1
c 2 1 ∞ 2 0
d 0 0 3 ∞ 4
e 0 0 0 3 ∞
No. of lines ≠No. of rows/columns
The minimum element is 1 from uncovered elements. Subtract it from uncovered and add it to
intersection elements.
Cities A B C D E
a ∞ 0 2 0 0
b 0 ∞ 1 0 0
c 2 1 ∞ 3 0
d 0 0 3 ∞ 4
e 0 0 0 4 ∞
No. of lines = No. of rows/columns
5=5
Hence, the optimal solution is reached.
Go for the assignment
Cities A B C D E
a ∞ 0 2 0 0
b 0 ∞ 1 0 0
c 2 1 ∞ 3 0
d 0 0 3 ∞ 4
e 0 0 0 4 ∞

a-D, d-B, b-A, the salesman not covering E city. Hence, it is not correct sequence.
Next minimum value of Zero is ‘1’.
Final Solution
Cities A B C D E
a ∞ 0 2 0 0
b 0 ∞ 1 0 0
c 2 1 ∞ 3 0
d 0 0 3 ∞ 4
e 0 0 0 4 ∞
A-D-B-C-E-A
3+6+5+3+4=21
Cities A B C D E
a ∞ 0 2 0 0
b 0 ∞ 1 0 0
c 2 1 ∞ 3 0
d 0 0 3 ∞ 4
e 0 0 0 4 ∞
A-D-E-C-B-A
3+4+6+7+5=25

3. A salesman has to visit 4 cities A, B, C, and D. The distance (100 kms) between 4 cities is:
If the salesman starts from city 'A' and comes back to city 'A', which route should he select so that total
distance travelled by him is minimum?
4. Solve the following travelling salesman problem with the following matrix.