Assignment problems Operational Research

Introduction
This

is a special type of transportation problem in which each source should have the capacity to fulfill the demand of any of the destinations. In other words any operator would be able perform any job regardless of his skills,although the cost( or the time taken) will be more if the job does not match with operators skill.
2

 Examples

of assignment problem
Column entity Cell entity
operators Processing time Processing time Processing time Travel time

Row entity
jobs

Programmer program operators Drivers machine Routes

Teachers

Subjects

Students pass percentage

3

Types of assignment problems

As

in transportation problems assignment problems also can be balanced ( with equal number of rows and columns) or unbalanced. When it is unbalanced the necessary number of row/s or column/s are added to balance it. That is to make a square matrix. The values of the cell entries of the dummy rows or columns will be made equal to zero.
4

Minimize the processing time

A
1 120

B
100

C
80

2
3

80
110

90
140

110
120

Hungarian method
Consists

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

Phase 1: Row and column reductions

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.
7

Phase 2: Optimization

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
8

 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
9

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

Problem 2

1 J1 5

2 9

3 3

4 6

J2 J3 j4

8 6 3

7 10 10

8 12 8

2 7 6

11

Problem 3

1 J1 11

2 7

3 10

4 17

5 10

J2
J3 J4

13
13 18

21
13 10

7
15 13

11
13 16

13
14 14

J5

12

16

19

10

12

Example : Assign the 5 operators to the 5

jobs such that the total processing time is minimized.
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
13

Maximization problem
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.

14

Example : Assign 4 sales persons to four

different sales regions sales is maximized.
Sales region
Sales person

such that the total

10

22

12

14

2
3 4

16
24 16

18
20 14

22
12 24

10
18 20
15

Modified data , after multiplying the cell entries by -1.

Sales region
Sales person

-10

-22

-12

-14

2
3 4

-16
-24 -16

-18
-20 -14

-22
-12 -24

-10
-18 -20
16

After step 1
Sales region
Sales person

1 2 3 4

12 6 0 8

0 4 4 10

10 0 12 0

8 12 6 4
17

After step 2
Sales region Sales person

1 2

12 6

0 4

10 0

4 8

3
4

0
8

4
10

12
0

2
0
18

Phase 2
Sales region Sales person

1 2

12 6

0 4

10 0

4 8

3
4

0
8

4
10

12
0

2
0
19

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

20

Example : Assign the 5 operators to the 5

jobs such that the total processing time is minimized. Operator 1 2 3 4
job

5 8

10

12

15

12

2
3 4 5

7
13 12 8

16
14 10 13

14
7 11 15

14
9 13 11

11
9 10 15
21

Example :ROW SCANNING.

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
22

Example : Assign the 5 operators to the 5 jobs such that the total processing time is minimized.
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
23

Example : Assign the 5 operators to the 5 jobs such that the total processing time is minimized.
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 3

2
0 7
24

Example : Assign the 5 operators to the 5 jobs such that the total processing time is minimized.
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 1

2
0 7
25

Example : Assign the 5 operators to the 5 jobs such that the total processing time is minimized.
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
26