21. Activity-on-Node Network Backward Pass FIGURE 6.7 Don’t panic!- the ES-EF boxes are still filled in, but this diagram is just emphasizing how to get LS and LF
22. Activity-on-Node Network with Slack FIGURE 6.8 Now that we have LS,LF in addition to EF, ES, we can fill LAST box in
23.
24.
25.
26.
Editor's Notes
WBS is hierarchical, Network is sequential, emphasizing interdependencies
Above is by WBS code, below is by description, presumably with a duration
Lets us do the post it activities bettter as well, wherein each activity is a
Much of this should be review from BUS786…. Fun activity- if not sure of sequences for activities, can put activities on post its and then move them around. (another reason to use AoN)
People may have some different dependencies Use the post its- (have people write the ID and durations on and as much of description as appropriate) Break into teams, give them 5 minutes to come up with an order. Find a volunteer team to present- see if others agree or disagree. Make changes as needed. Save one for future illustration
Can do a network- examples later
Now we are going to use the AON we did before to compute Slack by hand.
Start with first activities, fill in top (ES, EF). Convention is start at 0.
Don’t need to bother putting numbers on the arrows that are the sole arrow going into a node, in fact # on arrows are optional
Free slack typically occurs at the end of a path that feeds into a merge activity where another feeder is the critical path The whole ES-EF-LS-LF algorithm does not capture Free Slack, only Total Slack. Use MS Project.
Draw the AoN Network. CP R-D-F 11 days R-S-A-F 9 days- 2 days total slack for A,S, but only A has free slack. If S disappears for a day without telling anyone, A will be annoyed. Project won’t be late. However, if R,P, or F disappear for a day, the project is delayed as these are critical activities!