Suchita Nevrekar Aarti Asrani Martha Dsouza Pallavi Karande Urja Shah Pooja Bhalja

The Hungarian method is a combinatorial optimization algorithm which solves the assignment problem in polynomial time and which anticipated later primal-dual methods. In every workplace there are jobs to be done and there are people available to do them, but everyone is not equally efficient at every job. Someone may be more efficient on one and less efficient on other job. The relative efficiency is reflected in terms of time taken for or cost associated with, performance of different jobs by different people and obvious problem for manager to handle is to assign jobs to various workers in manner that they can be done in the most efficient way. Such problems can be formulated as liner programming problems and this method called as Hungarian Assignment Method.
2

Its allows a manager to obtain answers to the questions like following How to deal with situation when the number of jobs do no match with number of jobs performer

How should the salesman of the company be assign to different sales zone so that total excepted sales are maximize. How to schedule flight s or the bus routes between two cities so that the lay over times for the crew can be minimize How to assign the given jobs by some works on one to one basic when completion times of performance is given for each combination and it is desired that the jobs are completed in the list time and list cost.

General format of assignment problem

Job

1 2 . i . m

1 t11

Operators 2 j t12 t1j

m t1m

ti1
tm1 tm2

tij
tmj

tim
tmm
4

Examples of assignment problem

Row entity
jobs

Column entity Cell entity

operators Processing time Processing time Processing time

Programmer program operators machine

Drivers
Teachers

Routes
Subjects

Travel time
Students pass percentage
5

Consists of two phases. First phase: row reductions and column reductions are carried out. Second phase :the solution is optimized in iterative basis.

Step 0: Consider the given cost matrix Step 1: Subtract the minimum value of each row from the entries of that row, to obtain the next matrix. Step 2: Subtract the minimum value of each column from the entries of that column , to obtain the next matrix. Treat the resulting matrix as the input for phase 2.

Step3: Draw a minimum number of lines to cover all the zeros of the matrix. Procedure for drawing the minimum number of lines: 3.1 Row scanning 1 Starting from the first row ,if theres only one zero in a row mark a square round the zero entry and draw a vertical line passing through that zero. Otherwise skip the row. 2.After scanning the last row, check whether all the zeros are covered with lines. If yes go to step 4. Otherwise do column scanning. Ctd

3.2 Column scanning. 1. Starting from the first column: if theres only one zero in a column mark a square round the zero entry and draw a horizontal line passing through that zero. otherwise skip the column. 2.After scanning the last column, check whether all the zeros are covered with lines. If yes go to step 4. Otherwise do row scanning. ctd

Step 4: check whether the number of squares marked is equal to the number of rows/columns of the matrix. If yes go to step 7. Otherwise go to step 5. Step 5: Identify the minimum value of the undeleted cell values ,say x. Obtain the next matrix by the following steps. 5.1 Copy the entries covered by the lines ,but not on the intersection points. 5.2 add x to the intersection points 5.3 subtract x from the undeleted cell values. Step 6: go to step 3. Step 7: optimal solution is obtained as marked by the squares

10

If the problem is a maximization problem ,convert the problem into a minimization problem by multiplying by -1. Then apply the usual procedure of an assignment problem.

11

Sales region Sales person

1 2 3 4

10 16 24 16

22 18 20 14

12 22 12 24

14 10 18 20
12

Sales region Sales person

1 2 3 4

-10 -16 -24 -16

-22 -18 -20 -14

-12 -22 -12 -24

-14 -10 -18 -20

13

Sales region
Sales person

1
2

12
6

0
4

10
0

8
12

3
4

0
8

4
10

12
0

6
4
14

Sales region
Sales person

1
2

12
6

0
4

10
0

4
8

3
4

0
8

4
10

12
0

2
0
15

Sales region Sales person

1 2

12 6

0 4

10 0

4 8

3
4

0
8

4
10

12
0

2
0
16

Note that the number of squares is equal to the number of rows of the matrix. solution is feasible and optimal. Result: Salesman Sales region Sales 1 2 22

2
3 4

3
1 4

22
24 20

17

Operator job

1 10
7 13 12

2 12
16 14 10

3 15
14 7 11

4 12
14 9 13

5 8
11 9 10

1
2 3 4

13

15

11

15
18

Operator job

1 10 7

2 12 16

3 15 14

4 12 14

5 8 11

1 2

3
4 5

13
12 8

14
10 13

7
11 15

9
13 11

9
10 15
19

Operator job

1 10

2 12

3 15

4 12

5 8

2 3
4 5

7 13
12 8

16 14
10 13

14 7
11 15

14 9
13 11

11 9
10 15
20

Operator job

1 2 0

2 4 9

3 7 7

4 4 7

5 0 4

1 2

3
4 5

6
2 0

7
0 5

0
1 7

2
3 4

2
0 8
21

Operator job

1 2 0

2 4 9

3 7 7

4 2 5

5 0 4

1 2

3
4 5

6
2 0

7
0 5

0
1 7

0
1 2

2
0 8
22

Operator job

1 2 0

2 4 9

3 6 6

4 1 4

5 0 4

1 2

3
4 5

7
2 0

8
0 5

0
0 6

0
0 1

3
0 8

MA 402--assignment problem

24