Q. Assigning Tasks Assume a data processing department wishes to assign five programmers to five programming tasks (one programmer to each task). Management has estimated the total number of days each programmer would take if assigned to the different jobs, also these estimates are summarized in the following table.
Open table as spreadsheet
Task 1 2 3 4 5
1 50 25 78 64 60
2 43 30 70 56 72
Program 3 60 28 80 66 68
4 54 29 75 60 70
5 45 32 70 62 75
a. Determine the assignment that minimizes the total programmer days required to complete all five jobs.
b. Elucidate how the network diagram corresponding to the solution in (1). That is, label each of the arcs in the solution also verifies that the flows are consistent with the given information.
c. Elucidate how would your solution change if programmer 3 could not be assigned to tasks 2 or 4?