Find the Optimum Assignment Problem

Operator Hungerian Method

Step 1 1 2 3 4 5 Row Minimum Phase 1: Row and
1 9 11 14 11 7 7 Step 1- Subtract the min
Job 2 6 15 13 13 10 6 Step 2- Subtract the min
3 12 13 6 8 8 6
4 11 9 10 12 9 9 Phase 2: Optimization of t
5 7 12 14 10 14 7 Step 1- Draw a minimum number
a) Row scanning
Operator i) starting from the first
1 2 3 4 5 Is there exactly one zero in
vertical line passing through
1 2 4 7 4 0
2 0 9 7 7 4 ii) After scanning the la
step 2; otherwise; do co
Job 3 6 7 0 2 2
4 2 0 1 3 0 b) Column scannin
5 0 5 7 3 7 i) starting from the
0 0 0 2 0 Is there exactly one zero in
Col. Min horizontal line passing thro

Operator ii) After scanning the last co

Step 2 1 2 3 4 5 Step 2- Check wether the number

1 2 4 7 4 0 go to step 5; Otherwise go to step
2 0 9 7 7 4 Step 3- Identifiy the minimum val
Job 3 6 7 0 2 2 a) add the minimum va
4 2 0 1 3 0
5 0 5 7 3 7 b) subtract the minimu
Col. Min 0 0 0 2 0 c) all other entries rema

Operator Step 4- Go to step 1

1 2 3 4 5 Step 5- Treat the solution as mark
1 2 4 7 2 0
 2 0 9 7 5 4
Job 3 6 7 0 0 2 No. of marked squares= the no. of row the
4 2 0 1 1 0 4 Not Equa
5 0 5 7 1 7 Optimal solution is
0 0 0 0 0

Step 3
Operator Operator
1 2 3 4 5 1 2 3
1 2 4 7 2 0 Min. 1 2 4 6
2 0 9 7 5 4 1 2 0 9 6
Job 3 6 7 0 0 2 Job 3 7 8 0
4 2 0 1 1 0 4 2 0 0
5 0 5 7 1 7 5 0 5 6
0 0 0 0 0 0 0 0

Operator
1 2 3 4 5 Job Operator Time
1 1 1 5 7
2 1 2 1 6
Job 3 1 3 3 6
4 1 4 2 9
5 1 5 4 10
0 0 0 0 0 Total Processing time 38

1 2 3 4 5
1 9 11 14 11 7
2 6 15 13 13 10
3 12 13 6 8 8
4 11 9 10 12 9
5 7 12 14 10 14
Hungerian Method
Phase 1: Row and Column Reduction
Step 1- Subtract the minimum value of each row from the entries of that row
Step 2- Subtract the minimum value of each column from the entries of that column

: Optimization of the problem

raw a minimum number of lines to cover all the zeros of the matrix
a) Row scanning
i) starting from the first row, ask the following question
Is there exactly one zero in the first row? If yes, make a s square around that zeros entrly and draw a
vertical line passing through that zeros; otherwise skip that row

ii) After scanning the last row, check wether all the zeros are covered with lines. If yes , go to
step 2; otherwise; do column scanning

b) Column scanning
i) starting from the firstcolumn, ask the following question
Is there exactly one zero in the first column? If yes, make a s square around that zeros entrly and draw a
horizontal line passing through that zeros; otherwise skip that column

ii) After scanning the last column, check wether all the zeros are covered with lines.

heck wether the number of square marked is equal to the number of row of the matrix. If yes,
5; Otherwise go to step 3.
entifiy the minimum value of undeleted cell value
a) add the minimum value of undeleted cell at the intersection point of the present matrix

b) subtract the minimum value of undeleted cell value from all undeleted cell values
c) all other entries remain the same

o to step 1
eat the solution as marked by the squares as the optimal solution
the no. of row the matrix
5
Optimal solution is not reached, go to step 3

4 5
1 0
4 4
0 3 No. of marked squares= the no. of row the matrix
0 0 5 Equal 5
0 7 Optimal solution is r
0 0

hrs
the matrix

al solution is reached
Solve the following assignment problem using Hungerian method. The matrix
entries represent the processing time in hours.
Operator
A B C D Row min.
1 5 3 2 8 2
2 7 9 2 6 2
Job 3 6 4 5 7 4
4 5 7 7 8 5

A B C D
1 3 1 0 6
2 5 7 0 4
Job 3 2 0 1 3
4 0 2 2 3
0 0 0 3 Column min.

A B C D
1 3 1 0 3
2 5 7 0 1
Job 3 2 0 1 0 3 not equal to 4
4 0 2 2 0
0 0 0 0

A B C D Job Operator
1 2 0 0 2 1 2
2 4 6 0 0 2 3
Job 3 2 0 2 0 3 4
4 0 2 3 0 4 1
Total Processing time
Operator
A B C D
1 5 3 2 8
2 7 9 2 6
Job 3 6 4 5 7
4 5 7 7 8
Time
3
2
7
5
17 hrs
Solve the following assignment problem using Hungerian method. The matrix entries
represent the processing time in hours.
Job Dummy
1 2 3 4 5 6 step 1 check wether t
1 12 4 10 4 12 0 if not balanced balan
2 4 10 16 14 14 0
Operator

3 14 16 12 18 16 0
4 12 4 6 8 10 0
5 18 6 16 18 14 0
6 8 14 8 12 16 0

Job Dummy
1 2 3 4 5 6 Row min.
1 12 4 10 4 12 0 0
2 4 10 16 14 14 0 0
Operator

3 14 16 12 18 16 0 0
4 12 4 6 8 10 0 0
5 18 6 16 18 14 0 0
6 8 14 8 12 16 0 0

Job
1 2 3 4 5 6
1 12 4 10 4 12 0
2 4 10 16 14 14 0
Operator

3 14 16 12 18 16 0
4 12 4 6 8 10 0
5 18 6 16 18 14 0
6 8 14 8 12 16 0
Column Min. 4 4 6 4 10 0

Operator
1 2 3 4 5 6
1 8 0 4 0 2 0
 2 0 6 10 10 4 0
Job 3 10 12 6 14 6 0 4 is not equal to 6
4 8 0 0 4 0 0
5 14 2 10 14 4 0
6 4 10 2 8 6 0

step 3 Job
1 2 3 4 5 6
1 8 0 4 0 2 2 1
2 0 6 10 10 4 2 1 12
Operator

3 8 10 4 12 4 0 2 4

Operator
4 8 0 0 4 0 2 3 14
5 12 0 8 12 2 0 4 12
6 2 8 0 6 4 0 5 18
Column Min. 0 0 0 0 0 0 6 8

6 is equal to 6 optimal solution is reached

trix entries

step 1 check wether the problem is balanced assignment problem or not

if not balanced balance by adding dummy Job or Operator
Job Dummy
2 3 4 5 6 Operator Job Time
4 10 4 12 0 1 4 4
10 16 14 14 0 2 1 4
16 12 18 16 0 3 6 0
4 6 8 10 0 4 5 10
6 16 18 14 0 5 2 6
14 8 12 16 0 6 3 8
Total time in hrs 32