3 Each activity in a project can be performed by two different resource combinations

(Table 4). Assume that the usage rate of each resource is constant throughout the duration of each activity. Now find a schedule that minimizes the time required to complete the project. Resources I and II both are available at a level of 12 hours each day.

TABLE 4 Activity A B C D E F Immediate predecessors — A A — B, C D, E Mode 1 Duration (days) 2 3 5 3 2 1 Resource I required (hours/activity) 0 9 10 6 8 4 Resource II required (hours/activity) 5 6 5 9 6 3 Mode 2 Duration (days) 1 2 4 2 1 1 Resource I required (hours/activity) 12 12 8 6 9 4 Resource II required (hours/activity) 7 8 16 12 5 3