Question 22 (3 points)

Consider an assignment problem where we are trying to find the best assignment of Jobs to Machines. The table below gives the processing time for each Job if it were processed on each of 4 machines. The goal is to come up with the minimum time to process all 4 jobs.

Jobs/Machines	A	B	C	D
1	19	18	15	18
2	4	8	11	9
3 4	13 19	17 8	20 17	17 9

The 1^st two steps in the Hungarian Method would be to do Row Reduction and Column Reduction. If you were to do Row Reduction and Column Reduction (in that order), which of the following would represent the Row Reduced / Column Reduced table:

Question 22 options:

1)

Table

5	3	0	2
0	4	7	4
0	5	7	4
11	0	9	0

2)

Table

4	3	0	3
0	4	7	4
0	4	8	3
10	0	9	0

3)

Table

3	3	0	2
0	5	7	4
0	4	8	3
11	0	9	0

4)

Table

4	3	0	2
0	4	7	4
0	4	7	3
11	0	9	0