RashmiBachhas_02309152020

Application of Hungarian Method in Optimizing the Scheduling

of Employee Assignment

Assignment problems are special cases of the linear programming problems. The main objective is to
find the optimum allocation of a number of tasks(jobs) to an equal number of facilities or persons.
Here we make the assumption that each person can perform each job but with varying degree of
efficiency. The assignment problem involves scheduling each employee on the job on a one-to-one
basis that assigns each employee to exactly one job and each job is only assigned to one employee.
The purpose of the assignment problem is to schedule each employee on the job until all work is
completed in the minimum total time.
In this problem, the Hungarian method is applied to a home industry engaged in the production of
Aceh craft bags. This problem discusses about the time of assignment of employees, where each
employee can be assigned to the appropriate work, so that the minimum time for the bag productions
will be obtained.
The embroidery company consists of 11 employees identified as employees 1 to employee 11, which
produces 10 types of bags (listed in the table below) symbolized by A to J.

S.No Name of the Product Symbolization

.
i Hand bags of Mambo A
ii Hand bags of Lonjong B
iii Hand bags of Ransel C
iv Hand bags of Alexa D
v Hand bags of Tampang Bunga E
vi Hand bags of Keong F
vii Hand bags of Tima G
viii Hand bags of Luna H
ix Hand bags of Mikha I
x Hand bags of Elli J

Symbolization (Bags)

Employees

Fig. Duration of bag embedding/production (in minutes)

1
Here, the data obtained is stated in the form of matrix called cost or effectiveness matrix. Data
obtained after conducting research on the company is data in the form of length of time for
embroidering a particular bag in minutes by employees who work on it.
In this case, we want to optimize the assignment of the bag embroidery process.
Solution by Hungarian Method

 In the existing data, the number of employees i.e., 11 is not the same as the number of jobs
i.e., 10. Hence it is an unbalanced (11*10) matrix. In order to make it a balanced matrix, we
will introduce a dummy column to the matrix. Thus, reducing it to a 11*11 square matrix.

S.No. A B C D E F G H I J K
1 75 131 130 95 100 84 142 110 150 87 0
2 120 132 78 120 140 110 95 120 80 75 0
3 95 87 131 91 87 120 140 90 135 130 0
4 103 150 120 98 82 111 124 87 98 85 0
5 93 89 150 85 120 127 127 89 95 124 0
6 121 147 88 126 128 96 110 89 95 97 0
7 131 152 111 101 110 95 99 99 110 121 0
8 75 81 82 120 82 84 145 98 90 87 0
9 82 90 95 75 82 120 147 92 110 90 0
10 137 77 103 141 115 125 89 77 134 84 0
11 110 136 131 91 82 84 127 140 80 77 0

 As all the rows are already having at least one zero, next we are supposed to make at least
one zero in each column. For this we will subtract the minimum element of each column from
every element of the corresponding column.
 Then mark the Zero (assignments) in each row starting from first row and simultaneously
crossing the other zeroes in the corresponding column.
 Here, marked zero cell is depicted by
cross marked cell is depicted by
 Then, we will draw the minimum number of horizontal and vertical lines necessary to cover
all zeroes at least once.

S.No. A B C D E F G H I J K
1 0 54 52 20 18 0 53 33 70 12 0
2 45 55 0 45 58 26 6 43 0 0 0
3 20 10 53 16 5 36 51 13 55 55 0
4 28 73 42 23 0 27 35 10 18 10 0
5 18 12 72 10 38 43 38 12 15 49 0
6 46 70 10 51 46 12 21 12 15 22 0
7 56 75 33 26 28 11 10 22 30 46 0
8 0 4 4 45 0 0 56 21 10 12 0
9 7 13 17 0 0 36 58 15 30 15 0
10 62 0 25 66 33 41 0 0 54 9 0
11 35 59 53 16 0 0 38 63 0 2 0

 Then we will identify and select the smallest of the elements that do not have a line through
them, which in this case is ‘10’.

2
  We will subtract 10 from all the elements that do not have line through them and add it to
every element that lies at the intersection of two lines leaving the remaining elements of the
matrix unchanged.
 Then repeat the above procedure of drawing lines and subtracting and adding the smallest
element again until optimal solution is obtained.

S.No. A B C D E F G H I J K
1 0 54 52 20 28 0 53 33 70 12 10
2 45 55 0 45 68 26 6 43 0 0 10
3 10 0 43 6 5 26 41 3 45 45 0
4 18 63 32 13 0 17 25 0 8 0 0
5 8 2 62 0 38 33 28 2 5 39 0
6 36 60 0 41 46 2 11 2 5 12 0
7 46 65 23 16 28 1 0 12 20 36 0
8 0 4 4 45 10 0 56 21 10 12 10
9 7 13 17 0 10 36 58 15 30 15 10
10 62 0 25 66 43 41 0 0 54 9 10
11 35 59 53 16 10 0 38 63 0 2 10

 Now subtracting 2 from elements through which line is not passing and adding 2 to those
elements lying at the intersection.

S.No. A B C D E F G H I J K
1 0 54 52 22 28 0 53 33 70 12 12
2 45 55 0 47 68 26 6 43 0 0 12
3 10 0 43 8 5 26 41 3 45 45 2
4 18 63 32 15 0 17 25 0 8 0 2
5 6 0 60 0 36 31 26 0 3 37 0
6 36 60 0 43 46 2 11 2 5 12 2
7 46 65 23 18 28 1 0 12 20 36 2
8 0 4 4 47 10 0 56 21 10 12 12
9 5 11 15 0 8 34 56 13 28 13 10
10 62 0 25 68 43 41 0 0 54 9 12
11 35 59 53 18 10 0 38 63 0 2 12

 Hence, the following is the optimal solution minimising the time taken in embedding and
making the bags.

Employee Job Assigned Hand Bag Working Hours (minutes)

1 A Mambo 75
2 J Elli 75
3 B Lonjong 87
4 E Tampang Bunga 82
6 C Ransel 88
7 G Tima 99
8 F Keong 84
9 D Alexa 75
10 H Luna 77
11 I Mikha 80
Total time 822 mins

3
 Table. Results of scheduling using the Hungarian method

Conclusion

Based on the results of the assignment problem by Hungarian Method, we can conclude that each
employee should be assigned in the following manner, so that the minimum time for the bag
productions i.e., 822 minutes/ 13.7 hours can be obtained.

Employee Job Assigned Type of Bag

1 A Mambo
2 J Elli
3 B Lonjong
4 E Tampang Bunga
6 C Ransel
7 G Tima
8 F Keong
9 D Alexa
10 H Luna
11 I Mikha

4
5