DO NOT TYPE IN THE FILE. Print out the sheet and work the problem with a dark pencil. Develop a resource schedule in the loading chart below

using the parallel method. Place the appropriate resource quantities in the white schedule table cells. Be sure to also update each period, showing

the change in ES$,$ LF and Slack by period in the appropriate yellow table cells. What is the final order in which the activities are scheduled?

Note: Following are the heuristics to be used: Minimum Slack, Smallest Duration, Lowest ID Number$/$Letter$.$ Make sure not to violate network precedence relationships in your

resource$-$constrained schedule.