Draw the resource loading graph for each schedule in Exercise 5.6.

Exercise 5.6

Schedule the project in Exercise 5.3 using each of the following heuristics: CAF, LS, ES, LC, EC, TS, CRD, and ACTIM. What is the shortest project duration obtained? Which heuristics yield that shortest project duration?

Exercise 5.3

Use the minimum totals lack (Min TS) heuristic to schedule the resource-constrained project. If a tie occurs, use minimum activity duration to break the tie.

Units of resource type 1 available \(=10\)

Units of resource type 2 available \(=15\)

Resource Units Activity Predecessor a M b Type 1 Type 2 A 1 2 B 5 9 47 4 3 0 7 5 4 C 2 4 10 5 4 1 DEFC A 1 3. C 4 5 +7 4 2 0 7 A 3 4 G B, D, E 1 2 3 42 53 3 7 19 6 2