Scheduling

Once the relevant cost information has been acquired and arranged
tabular form, the basic procedure of the Assignment method is as follow:
1) Subtract the smallest number in each row from every number in
the row. This is called a row reduction. Enter the results in a new
table.
2) Subtract the smallest number in each column of the new table from
every number in the column. This is called a column reduction.
Enter the results in a new table.
3) Test whether an optimum assignment can be made. You do this by
determining the minimum number of lines (horizontal or vertical)
needed to cross out (cover) all zeros. If the number of lines equals
the number of rows, an optimum assignment is possible. In that
case, go to step 6. Otherwise go on to step 4.
4) If the number of lines is less than the number of rows, modify the
table in this way:
a. Subtract the smallest uncovered number from every
uncovered number in the table.
b. Add the smallest uncovered number to the numbers at
intersections of cross-out lines carry over to the next table.
c. Carry over numbers crossed out but not at intersections of
cross-out lines carry over to the next table.
5) Repeat steps 3 and 4 until an optimal table is obtained.
6) Make the assignments. Begin with rows or columns with only one
zero. Match items that have zeros, using only one match for each
row and each column. Eliminate both the row and the column after
the match.
 Exercise:
Determine the optimum assignment of jobs to workers for the
following data:

A B C D
1 8 12 6 17
2 11 6 12 8
3 15 12 8 13
4 14 10 12 13

Solution:

A B C D
1 8 12 6 17
2 11 6 12 8
3 15 12 8 13
4 14 10 12 13
 Subtract the smallest number in each row from every number in
the row. Enter the results in a new table.

A B C D
1 2 6 0 11
2 5 0 6 2
3 7 4 0 5
4 4 0 2 3
 Subtract the smallest number in each column of the new table
from every number in the column. Enter the results in a new
table.
 B C
A D
1 0 6 0 9
2 3 0 6 0
3 5 4 0 3
4 2 0 2 1

 Determine the minimum number of lines (horizontal or vertical)

needed to cross out (cover) all zeros.(Try to cover as many
zeros as possible when drawing lines).
 Since the number of lines equals the number of rows, an
optimum assignment is possible.
 Make assignments: start with rows and columns with only one
zero. Match jobs with machines that have a zero cost.
Assignment Cost
1-A 8
2-D 8
3-C 8
4-B 10
Total 34$

Exercise:
Determine the optimum assignment of jobs to workers for the
following data:

A B C D
1 8 6 2 4
2 6 7 11 10
3 3 5 7 6
4 5 10 12 9
Solution:

A B C D
1 8 6 2 4
2 6 7 11 10
3 3 5 7 6
4 5 10 12 9

A B C D
1 6 4 0 2
2 0 1 5 4
3 0 2 4 3
4 0 5 7 4

A B C D
1 6 3 0 0
2 0 0 5 2
3 0 1 4 1
4 0 4 7 2

 Since only three lines are needed to cover all zeros and the table
has four rows, this is not the optimum. Note that the smallest
uncovered value is 1.
 Subtract the smallest uncovered value from every uncovered
number that hasn’t been covered, and add it to numbers that are at
the intersections of covering lines. The results are as follows:
 A B C D
1 7 3 0 0
2 1 0 5 2
3 0 0 3 0
4 0 3 6 1

 Determine the minimum number of lines (horizontal or vertical)

needed to cross out (cover) all zeros. Since this equals the number
of rows, you can make the optimum assignment.

A B C D
1 7 3 0 0
2 1 0 5 2
3 0 0 3 0
4 0 3 6 1

Assignment Cost
1-C 2
2-B 7
3-D 6
4-A 5
Total $20