ASSIGNMENT TECHNIQUE

REFERNCE BOOK V. K. KAPOOR PRATIK LAWANA (10B729)

1.Four operators 1 , 2 ,3 4 are available to a manager who has to net four jobs 1 , 2 ,3 4 done by assigning one job to each operator. Given the times needed by different operators for different jobs in the matrix below :
1 1 2 3 4 12 14 6 8 2 10 12 10 10 3 10 15 16 9 4 8 11 4 7

i.How should the manager assign the jobs so that the total time needed for all jobs is minimum ? ii.If Job 2 is not to be assigned to operator 2 , what should be the assignment and how much additional total time will be required ?

Solution: Step 1: Identify the minimum element in each row and subtract it from every element of that row.

Step 2: Identify the minimum element in each column and subtract it from every element of that column.

Step 3: Draw the minimum number of vertical and horizontal lines necessary to cover all the zeros in the reduced matrix obtained from step 2.

Step 4: Examine the rows successively until a row with exactly one unmarked zero is found. Enclose this zero in a box as an assignment will be made there and cross all other zeros appearing in the corresponding column as they will not be considered for future assignment.

i. Optimal Assignment Operators Jobs 3 2 4 1 Total Time 10 12 4 8 34 Therefore, the total time needed for all Jobs is 34 units. ii. Jobs 2 is not to be assigned to operator 2 . So put X in the given table of time of all Jobs and Operators.

1 2 3 4

Step 1: Identify the minimum element in each row and subtract it from every element of that row.

Jobs
Operators 1 2 3 4 1 4 3 2 1 2 2 X 6 3 3 2 4 12 2 4 0 0 0 0

Step 2: Identify the minimum element in each column and subtract it from every element of that column.

Step 3: Draw the minimum number of vertical and horizontal lines necessary to cover all the zeros in the reduced matrix obtained from step 2.

Step 4: Select the smallest element from all the uncovered elements. Subtract this smallest element from all the uncovered elements and add it to the elements, which lie at the intersection of two lines. Thus, we obtain another reduced matrix for fresh assignment and again follow step 3.

Jobs
Operators 1 2 1 3 1 2 0 X 3 0 1 4 1 0

3
4

0
0

3
1

9
0

0
1

Step 5: Examine the rows successively until a row with exactly one unmarked zero is found. Enclose this zero in a box as an assignment will be made there and cross all other zeros appearing in the corresponding column as they will not be considered for future assignment.

Jobs
Operators 1 1 3 2 0 3 0 4 1

2
3 4

1
0 0

X
3 1

1
9 0

0
0 1

Assignment as per condition Operators 1 2 3 Jobs 2 4 1 Total Time 10 11 6

9
36

Therefore, the total time needed if 2 is not assigned to 2 is 36 units. Therefore, 2 units additional total time will be required.