Scribd
Upload
81 views17 pages

Coursera 4

The document discusses critical path analysis for project scheduling. It provides an example problem with an activity-on-node network diagram and calculations for determining the critical path. The critical path is the longest path in terms of duration that determines the minimum time needed to complete the project.

Uploaded by

Salma Touzouz
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
81 views17 pages

Coursera 4

The document discusses critical path analysis for project scheduling. It provides an example problem with an activity-on-node network diagram and calculations for determining the critical path. The critical path is the longest path in terms of duration that determines the minimum time needed to complete the project.

Uploaded by

Salma Touzouz
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 17

Critical Path

1 10 10 17
B E
9 7
1 10 10 17

0 1 1 7 7 1 17 18
1
A C F G
1 6 4 1
0 1 4 10 13 17 17 18

1 14
D
13 ABEG = 1+9+7+1 = 18 days
ACEG = 1+6+7+1= 15 days
4 17 ACFG = 1+6+4+1 = 12 days
ADG = 1+13+1 = 15 days
1 10 10 17
B E
9 7
1 10 10 17

0 1 1 7 7 1 17 18
1
A C F G
1 6 4 1
0 1 4 10 13 17 17 18

1 14
D
13 ABEG = 1+9+7+1 = 18 days
ACEG = 1+6+7+1= 15 days
4 17 ACFG = 1+6+4+1 = 12 days
ADG = 1+13+1 = 15 days
Critical Path
1. All projects will have at least one critical path.
2. All critical activities belong to a critical path.
3. A delay in any critical activity will extend the
project duration.
4. The noncritical activities can be delayed at least
1 day without lengthening the project duration.
5. Saving time in any noncritical activity does not
decrease at all the project’s duration.
Example 1
• Draw an activity on node network diagram and
perform forward and backward pass calculations.

Activity Predecessor Duration


A - 4
B A 7
C A 5
D B 8
E B,C 5
F C 2
G D,E,F 1
ES EF
4 1 1 19
Activity
1 1
B D Duration
7 8
LS LF
4 1 1 19
1 1
0 4 1 16 19 20
1 E G
A
4 5 1
0 4 14 19 19 20

4 9 9 1
1
C F
5 2
9 14 17 19
ES EF
4 1 1 19
Activity
1 1
B D Duration
7 8
LS LF
4 1 1 19
1 1
0 4 1 16 19 20
1 E G
A
4 5 1
0 4 14 19 19 20

4 9 9 1
1
C F
5 2
9 14 17 19
Example 2
• Draw an activity on node network diagram and
perform forward and backward pass calculations.
Activity Predecessor Duration
A - 2
B A 5
C A 9
D A 3
E B 6
F B,C 4
G C,D 2
H E,F 4
I G,H 2
7 13
2 7
E
B
6
5 15 19
9 15
4 9 H
4
0 2 2 1 1 15 19 21
1 1 15 19 I
A C F
2 9 4 2

0 2 2 1 1 15 19 21
1 1

2 5 1 13
1
D G
3 2
14 17 17 19
Example 4 (SS Relationship)
Example 5 (FF Relationship)

You might also like