- 95 Views
- Uploaded on
- Presentation posted in: General

CRITICAL PATH ANALYSIS MAY 2011 PAPER

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -

CRITICAL PATH ANALYSISMAY 2011 PAPER

DETAILED STEP BY STEP ANSWER GUIDE

Activity A

- Is an independent event.
- It takes 2 weeks.
Activity B

- Must follow A.
- 2 + 2 = 4 weeks
Activity C

- Must follow B.
- 4 + 5 = 9 weeks.
Activity D

- Must follow B
- 4 + 7 = 11 weeks

CRITICAL PATH CHECK

Activity E

- Must follow C.
- 9 + 4 = 13 weeks.
Activity F

- Must follow D.
- 11 + 3 = 14 weeks.
Activity G

- Must follow E & F.
- F is the longest.
- So. 14 + 3 = 17 weeks.

Activity H

- must follow G.
- 17 weeks + 2 = 19 weeks.
Activity I

- 19 weeks + 5 = 24 weeks.

Critical Path Check

Relationship between

Activity I & Activity H

Total Activity 1 = 24

Minus (duration) 5

= 19 weeks

Activity H is critical

- 24 represents the total project time.
- It will be the final node in our network.
- It will be the 9th activity & therefore 9th node.
- Therefore our last node will look like:

24

24

9

- What activities must happen to reach node 9 (24 weeks)
- We can identify the critical path by subtracting the duration from each activity, to see if it equals the previous activity.
- The table on the next page summarizes the relationships.

- On the answer sheet, you will notice there appears to be an activity node missing
- The node that appears missing is Activity E.
- To understand, why this is the case, you must look at Activity G. Activity G is dependent on E & F.
- As a general rule, whenever, the following event is dependent on two previous events, the two activities will be combined into one node.
- Whatever, is the largest number will dominate.
- Thus F, is clearly larger than E & being the critical path will dominate.
- Therefore activity E, is actually not represented by itself.

Calculate the total float on the network diagram & common ton its implications for New World

What is the total float?

This is the amount of a time a sequence of tasks can be delayed without having an impact on the whole process.

Very Important: Critical Path & Float

- All activities on the critical path have 0 floats and there is no need for calculations.
- Therefore only activities C & D, require a float calculation.

Formula for Calculating the Total Float

- LFT of the current activity
(minus -) duration of the current activity

(minus -) EST of the previous activity

Activity C

10 – 5 – 4 = 1 week

Activity E

14-4-9 = 1 week