Activity On Node/ Precedence

Diagram
Precedence Diagram

 Activity represented by nodes (which may be circular, rectangular or other common geometric

shape).

 Lines represent activity links and dependencies (Relationships).

 Diagram read from left to right.

A B
Precedence Networks
 Precedence Diagramming Method, PDM, uses node diagrams with four types of logical
relationships:
• Finish-to-Start, F-S
• Start-to-Start, S-S
• Finish-to-Finish, F-F
• Start-to-Finish, S-F
 Precedence networks incorporate:
◦ Lags and leads
◦ Overlapping activities
Finish to Start (FS) Relationship

.The traditional relationship between activities .

Implies that the preceding activity must finish before the succeeding activities can .
.start

.Example: the excavation must be finished before the lean can start .

Excavation Lean
Node Format

Activity Name

ES Duration EF

LS FF TF LF

Note: Although there are many ways to represent AON, we would be following this
format.
Advantages of Using AON
 Analytical solution is simpler.
 No dummy activity are required (except start/finish dummy).
 A single number can be assigned to identify each activity.
 Allow the usage of various type of relationship i.e. finish to start (FS), start to
start (SS), finish to finish (FF), and start to finish (SF)
Example 1
Draw the node network for the project given next.

IPA Activity
- A
A B
A C
B,C D

A D

C
Example 2
Draw the node network for the project given next.

IPA Activity
- A
A B
A C
B D
C,D E

B D
A E

C
 9
Example 3
Draw the node network for the project given next.
IPA Activity
- A
A B
A C
B D
B,C E
C F
B D

A PF
E

C F
Recommendations for Proper Node Diagram Drawing

Incorrect Correct
Improper Proper

A B
B

A
A

B
Improper Proper
Improper Proper
(a) Do not start a network with more than one node

A A

B PS B

C C

Improper Proper
(a) Do not end a network with more than one node

A A

B B PF

C C

Improper Proper
Calculation Formula
1) Forward Calculations

EF = ES + D

Calculate the Lag

LAGAB = ESB – EFA

Calculate the Free Float

FF = Min. (LAG)
2) Backward calculations

For the last task

LF = EF , if no information deny that.

LS = LF-D

Calculate Total Float

TF = LS – ES OR LF – EF

Determine the Critical Path

 Act ID Activity Description IPA Dur Laborers
A Purchase & Deliver materials - 5 2
Example 4 B Remove old vinyl tile - 7 4
C Install ceramic tile A 3 3
D Install new vinyl tile A, B 5 3
E Clean up & inspect C, D 2 2

0, 5 5, 8
A C
0 5 3 12, 14
2, 7 9, 12 E
PS
0, 7 7, 12 2

0 B D 12, 14
7 5

0, 7 7, 12
Example 5
Draw the logic network and perform the CPM calculations for the schedule shown
next.

Duration IPA Activity

5 - A
8 A B
6 A C
9 B D
6 B, C E
3 C F
1 D, E, F G
Solution

5,13 13,22

B D
8 9
0,5
13,19 22,23

A
5 E G
6 1

5,11 11,14

C F
6 3
 Solution
5,13 13,22

B D
8 9
0,5 5,13 13,22
13,19 22,23
A
E G
5
6 1
0,5
16,22 22,23
5,11 11,14

C F
6 3
10,16 19,22
CPM ( ES = LS , EF = LF , TF = FF = 0)
In the previous example we can find the free float and total float for each activity as the following :

Activity C’s free float, FF = 11 - 11 = 0 days

And
Activity C’s total float, TF =16 - 11= 5 days …… and so on.

FF TF LF LS EF ES Duration Activity

0 0 5 0 5 0 5 A
0 0 13 5 13 5 8 B
0 5 16 10 11 5 6 C
0 0 22 13 22 13 9 D
3 3 22 16 19 13 6 E
8 8 22 19 14 11 3 F
0 0 23 22 23 22 1 G
 Critical activity
 Note : We must always realize that FF ≤ TF
Duration IPA Activity

1 - A

9 A B

5 A C

5 C,B D

4 C E

4 E,D F

6 E G

1 G,F H

23
 Example- Home task

1) Forward pass calculations 4) Backward pass calculations

5) Calculate total Float (TF = LS – ES OR LF – EF)

A 0
B 0
D 0
F 0
H
1 1 1 2 9 2 11 5 11 16 4 16 20 1 20
2 0 0 2 11 0 0 11 16 0 0 16 20 0 0 20 21 0 0 21

4 5 3
0
C E G
0 0
2 5 5 7 4 10 11 6 14
7 0 3 10 11 0 3 14 17 3 3 20

2) Calculate the Lag ( LAGAB = ESB – EFA)

3) Calculate the Free Float (FF) FF = min.( LAG)
 6) Determine the Critical Path

A 0
B 0
D 0
F 0
H
1 1 1 2 9 2 11 5 11 16 4 16 20 1 20
2 0 0 2 11 0 0 11 16 0 0 16 20 0 0 20 21 0 0 21

4 5 3
0
C E G
0 0
2 5 5 7 4 10 11 6 14
7 0 3 10 11 0 3 14 17 3 3 20

The critical path passes through the critical activities where TF = 0

Dangling Activities
 Dangling activities are tied from one end
only.
 Dangling activities have either no
predecessors or no successors.
 As mentioned previously, we like to
always start the network with one
activity (e.g., Notice to Proceed) and end
it with one activity (e.g., Final
Completion). So provide a start/finish
dummy if needed.
Dangling Activities

A A

B PS B

C C

Dangling Activities

(a) Do not start a network with more than one node

Practice Problems from reference book of Jimmie
W. Hinze
29