HUNGARIAN METHOD

EXCEPTIONAL CASES

MAXIMIZATION

If the problem is of maximization Hungarian method cannot be applicable directly. To apply the method first convert it into minimization by subtracting all the elements of the matrix from the largest element of that matrix

Unbalanced A.P.

Any assignment problem is said to be unbalanced if the cost matrix is not a square matrix i.e. the number of rows and the number of columns are not equal. To make it balanced we add a dummy row or dummy column with all the entries as zero.

Practice problem

There are four jobs to be assigned to the machines. Only one job could be assigned to one machine. The amount of time in hours required for the jobs in a machine are given in the following matrix.Find an optimum assignment.

A 1 4

B 3

C 6

D 2

E 7

2
3 4

10 12 11 14 16
4 8 3 7 2 6 1 9 5 6

Hungarian method

Since the cost matrix is unbalanced we add a dummy job 5 with corresponding entries zero. Job number 5 is a dummy job

A 1 4

B 3

C 6

D 2

E 7

2
3 4 5

10 12 11 14 16
4 8 0 3 7 0 2 6 0 1 9 0 5 6 0

HUNGARIAN METHOD

Step-1 Row minimization Step-2 Column minimization No.of lines = 4 No. of rows= 5 Go to next step

L3 2 1 4 0 5

L4 0
3 L2 2 L1 0

2
2 1 0

1
1 0 0

4
0 3 0

6
4 0 0

HUNGARIAN METHOD

STEP-3 Subtracting smallest element 1 from uncovered, adding 1 in cross elements and keeping the other elements same the modified matrix is No of lines=rows Assignment is possible.

L5 1

L4 0
L3 2 L2 2 L1 0

2
1 1 0

1
0 0 0

5
0 4 1

6
3 0 0

HUNGARIAN METHOD

Different assignments are 1- B 1-B 1-D 2- A 2- A 2-A 3- D 3- D 3-C 4- C 4- E 4-E 5- E 5- C 5-B Total minimum time = 20 min

HUNGARIAN METHOD

Five jobs are to be processed and five machines are available. Any machine can process any job with the resulting profit (in rupees) as follows: What is the maximum profit that may be expected if an optimum assignment is made?

A 1

32 38 40 28 40

2
3 4 5

40 24 28 21 36
41 27 33 30 37 22 38 41 36 36 29 33 40 35 39

Hungarian method

Step1 Since the problem is of maximization type subtracting all elements of the matrix from the largest element the modified matrix will become

13 1

1
0

17 13 20 5
14 8 0 1 11 4 5 6 5 2

19 3 12 8

Hungarian method

Step 2 By row minimization the matrix becomes

0
0

14 12 14 4
12 8 0 0 6 0 0 4 5 1

19 1 11 5

Hungarian method

Step-3 By column minimization No of lines =4 No. of rows = 5

L2 L1 8 0 0 7 0

0
0

14 12 14 4
12 8 0 0 6 0 0 4 8 1

L3 19 1 L4 11 5

Hungarian method

Step-4 Selecting smallest element 4 from uncovered elements and adding the same at the intersection and keeping the other elements same the modified matrix becomes

L4 L5 12 0

L3 L2 L1 0 7 0

0
0

10 8
8 4 0 0

10 0
2 0 0 0 8 1

23 1 15 5

Hungarian method

Different assignments are 1- B 1- B 1- B 2- A 2- E 2- A 3- E 3A 3-E 4- C 4D 4D 5- D 5C 5C Total profit = 191 units

1-B 2-E 3-A 4-C 5D