Project Management
Bar / Gantt Charts
1. How to draw a Gantt Chart?
Activity
Activity
A
B
C
D
A
B
C
D
0
Predecessor
A
B
C
1
Duration
2
3
4
3
2 3 4 5 6
Duration (days)
7
8
9 10 11 12
2. How to draw a Gantt chart with more complicated predecessors
Activity
Activity
A
B
C
D
E
F
G
H
I
Predecessor
A
A
B
C
D
B
D
C
Duration
2
3
2
3
4
2
1
3
2
A
B
C
D
E
F
G
H
I
0 1 2 3 4 5 6 7 8 9 10 11
Durations
Activity
3. Advantages and disadvantages of Gantt charts
Activity
Predecessor
Duration
Cost of
(days)
activity
A
2
$400
B
A
3
$1200
C
B
4
$1200
D
C
3
$300
A
B
C
D
0
Daily cost
Accumulative
Cost
1
2
3
4
5
6
7
Duration (days)
$200
$200
$400
$400
$200
$400
$800 $1,200 $1,600 $1,900 $2,200 $2,500 $2,800 $3,100 $3,200 $3,300
$400
$300
$300
8
9
10
11
12
$300
$300
$100
$100
$100
Advantages
1. Easy to understand
2. Effective communication tool
3. Identify resource requests
Disadvantages
1) Out of control when there are too many activities
2) don’t really show the predecessor logic / relationship
3) don’t show impact of delaying an activity
Precedence Diagram Method (PDM Network Diagram)
4. How to draw a PDM network diagram
Activity
Predecessor
Duration
A
5
B
A
4
C
A
5
D
B
6
E
C
3
F
D,E
4
Act
Dur
D
B
F
A
E
C
B
4
D
6
A
5
F
4
C
5
E
3
5. Construct a PDM network diagram when given a table of dependencies
Activity
Predecessor Duration
A
3
B
D
B
A
4
C
A
2
D
B
5
A
E
E
C
1
F
C
2
G
D,E
4
C
F
H
F,G
3
Act
Dur
G
H
D
5
B
4
G
4
A
3
E
1
C
2
H
3
F
2
6. Construct a table of dependencies when given a PDM network diagram
Fill in the blank below table
Activity
Predecessor Duration
Act
Dur
D
5
B
4
A
3
G
4
E
1
C
2
F
2
H
3
7. Determine Early Start (ES) and Early Finish (EF) of activities in a PDM network diagram
Activity
Predecessor Duration
D
B
A
5
B
A
4
C
A
5
F
A
D
B
6
E
C
3
C
E
F
D,E
4
ES Act EF
Dur
0
A
5
5
B
4
9
9
D
6
Forward Pass always
take the largest value
15
5
15
5
C
5
10
10
E
3
F
4
19
13
8. Determine Late Start (LS) and Late Finish (LF) of activities in a PDM network diagram
Activity
A
B
C
D
E
F
Predecessor
A
A
B
C
D,E
Duration
5
4
5
6
3
4
ES Act EF
LS Dur LF
0
0
A
5
5
5
5
5
D
B
F
A
C
B
4
9
9
9
9
E
D
6
15
15
Backward Pass always
take the lowest value
5
7
C
5
10
12
Forward Pass always
take the largest value
15
15
10
12
E
3
13
15
F
4
19
19
9. Use forward and backward pass to determine project duration and critical path
Activity
Predecessor Duration
A
3
B
D
G
B
A
4
C
A
2
D
B
5
A
E
E
C
1
F
C
2
G
D,E
4
C
F
H
F,G
3
ES Act EF
LS Dur LF
H
7 D 12
7 5 12
3 B 7
3 4 7
0 A 3
0 3 3
12 G 16
12 4 16
5 E 6
11 1 12
3 C 5
9 2 11
16 H 19
16 3 19
5 F 7
14 2 16
Critical Path Method (CPM Network Diagram)
10. Introduction to CPM network diagrams
Network Diagrams PDM VS CPM
PDM=Precedence Diagram Method
@ “AON” =Activity On Node
A
B
CPM= Critical Path Method
@ “AOA”= Activity On Arrow
C
1
A
B
2
C
3
4
B
3
D
A
B
E
A
C
1
C
2
D
4
5
A
1
4
B
2
B
5
C
3
2
A
1
3
C
6
6
4
E
6
11. How to draw a CPM Network Diagram
Example 1:Activity
Predecessor
A
B
A
C
A
D
B
1
E
C
F
C
G
D,E,F
H
G
Example 2:Activity
Predecessor
A
B
C
A
D
A
E
B
F
D
G
B,C
3
6
4
5
8
7
2
D
C
2
A
F
5
G
4
6
1
3
B
E
12. CPM vs. PDM Network Diagram example
Activity
A
B
C
D
E
Predecessor
A
A
B,C
D
Duration
5
3
4
2
5
CPM Method
ES Act EF
LS Dur LF
5 B 8
6 3 9
0 A 5
0 5 5
9 D 11
9 2 11
11 E 16
11 5 16
5 C 9
5 4 9
PDM Method
3
B
3
A
1
2
5
D
C
4
4
E
6
5
2
5
Float / Slack in Network Diagrams
13. What is Total Float (Total Slack) and how to calculate it in a network diagram
Activity Predecessor Duration Total Float = TF
TF = LF – EF “ Finish Float”
A
5
TF = LS – ES “ Start Float”
B
A
3
C
D
E
A
B,C
D
4
2
3
ES Act EF
LS Dur LF
TF=0
0 A 5
0 5 5
TF=1
5 B 8
6 3 9
TF=0
9 D 11
9 2 11
TF=0
11 E 14
11 3 14
TF=0
5 C 9
5 4 9
14. What is Free Float (Free Slack) and how to calculate it in a network diagram
Activity
A
B
C
D
E
F
Predecessor Duration
5
A
4
A
5
B
6
C
3
D,E
4
Free Float =FF = Minimum ES successor – ES activity – Duration activity
FF ≤ TF
ES Act EF
LS Dur LF
TF=0
0 A 5
0 5 5
FF=0
TF=0
5 B 9
5 3 9
FF=0
TF=0
9 D 15
9 6 15
FF=0
TF=2
5 C 10
7 4 12
FF=0
TF=2
10 E 13
12 2 15
FF=2
TF=0
15 F 19
15 4 19
FF=0
15. Determine total float and free float (aka "slack") of activities in a network diagram
Activity Predecessor Duration
A
3
B
A
4
C
A
2
D
B
5
E
C
1
F
C
2
G
D.E
4
H
F,G
3
ES Act EF
LS Dur LF
TF=0
0 A 3
0 3 3
FF=0
TF=0
3 B 7
3 4 7
FF=0
TF=6
3 C 5
9 2 11
FF=0
TF=0
7 D 12
7 5 12
FF=0
TF=6
5 E 6
11 1 12
FF=6
TF=9
5 F 7
14 2 16
FF=9
TF=0
12 G 16
12 4 16
FF=0
TF=0
16 H 19
16 3 19
FF=0