In the example above, if the sales manager cannot be hired for three weeks, how will that affect the total project?

Example
The implementation of a new logistics operation involves the purchase of a fleet of trucks, the design of new routes and the building of a new distribution centre and associated handling equipment. Figure 16.20 provides an AoN network for the project. The earliest start times for each activity are found by working from left to right across the network. Each start event can begin at t = 0. At a 'merge' event (where two or more activities come together, as at event 12), use the latest completion date of the various activities which lead into it. Earliest finish times of a 'burst' activity (such as activity 6, where five succeeding activities literally
'burst' out) are carried forward to form the earliest start dates of the succeeding activities (7 through 11). The latest start times for each activity are found by working back from right to left across the network. The earliest start time for the final event on the network is often used as the latest start time for that event as well. At a 'merge' event (such as event 6), use the earliest completion date of the various activities.

Transcribed Image Text:

0 17 17 1 Des log 0 0 17 Earliest start time Duration 17 34 51 2 Ref log 18 1 52 Total float 17 4 21 3 Plan app 51 34 55 Earliest finish time Activity number Activity description Latest finish time 17 74 91 4 Syst req 17 0 91 51 39 90 5 Supp neg 1 91 52 21 12 33 6 Plan cons 56 34 67 Latest start time Activity on node (AoN) convention Figure 16.20 New logistics operation: precedence network 33 12 55 7 Mech hand 79 46 91 33 24 57 8 Bldg const 67 34 91 33 11 44 9 Tract proc 80 47 91 33 8 41 10 Trail proc 83 50 91 33 14 47 11 Rec & train 77 44 91 91 2 93 12 Prove syst 91 0 93