19 A B 0 0 D 6 G Question 2(b): Network Analysis - Reverse Working 10 Marks The following information on activities, the Earliest Start Time (EST), Latest Start Time (LST), Earliest Finish Time (EFT), in days, is given for a certain project: Activity EST LST EFT Crashing Cost / day 0 5 1,000 6 6 2,000 5 8 9 3,000 5 7 8 4,000 E 5 5 5,000 F 6 6 10 6,000 10 10 24 7,000 H 9 12 21 8,000 1 24 24 26 9,000 Given that: Gis immediately preceded by F and D. B's successor is H and H's successor is I. It is not possible to have a zero duration activity. 1. What is the Project Completion Time? 2. Find the LFT (Latest Finish Time) of Activities C, D, H and B. 3. Reduce the Project Duration by three days, by performing step by step crashing to minimize Crashing Cost, assuming that no activity can be crashed by more than one day. 4. After the crashing exercise, if Activity H's duration is increased by one day, by how many days can you increase the duration of each of Activities B and C without delaying the project beyond its crashed duration? Explain the underlying concept. (You are not expected to present the Network Diagram). (You may opt the following format for your answer). 1. Duration 2. LFT: C: D: H: B: Crash Activity Days Cost) 3. Step 1 4. III Activity B C Increase duration by (days)