ASSIGNMENT

PROBLEM
GROUP 15
ANISHA
 QUESTION
Five jobs are to be assigned to 5 machines to minimize the total
time required to process the jobs on machines. The times in hours
for processing each job on each machine are given in the matrix
below. By using assignment algorithm make the assignment for
minimizing the time of processing.
 Question
A B C D E

1 13 8 16 18 19

2 9 15 24 9 12

3 12 9 4 4 4

4 6 12 10 8 13

5 15 17 18 12 20
 STEP 1 Choose the least element in each row and

subtract it from all the elements of that row.

5 0 8 10 11

0 6 15 0 3

8 5 0 0 0
SOLUTION
0 6 4 2 7

3 5 6 0 8
 STEP 2 Choose the least element In each column and

subtract It from all the elements of thatcolumn..

5 0 8 10 11

0 6 15 0 3

8 5 0 0 0
SOLUTION
0 6 4 2 7

3 5 6 0 8
 STEP 3 Draw minimum number of horizontal and/or

vertical lines to cover all zeros.

5 0 8 10 11

0 6 15 0 3

8 5 0 0 0
SOLUTION
0 6 4 2 7

3 5 6 0 8
 STEP 4 subtract the minimum uncovered element from all uncovered

elements and add this element to all elements at the

intersection point of the lines covering zeros.

5 0 5 10 8

0 6 12 0 0

11 8 0 3 0
SOLUTION
0 6 1 2 4

3 5 3 0 5
 STEP 5 Draw again minimum number of horizontal and/or

vertical lines to cover all zeros.

5 0 5 10 8

0 6 12 0 0

11 8 0 3 0
SOLUTION
0 6 1 2 4

3 5 3 0 5
 STEP 6 Thus all the four assignments have been made. The

optimal assignment schedule and total cost is

Jobs Machines

1 B

2 E

3 C

4 A

SOLUTION 5 D

Minimum (total cost) = 8+12+4+6+12 =42

Thank You