PERT Chart Demonstration

1
PERT ChartDemonstration
2
An Example
3
We can now build a PERT Chart
4
We can now build a PERT Chart
4
5
3
4
5
6
7
3
3
4
5
8
7
4
7
3
3
4
5
8
8
4
7
3
3
4
10
5
8
9
4
7
3
3
4
10
5
8
3
10
4
8
7
3
3
4
10
5
8
3
11
4
8
7
3
3
4
10
5
8
3
5
12
4
8
7
3
3
4
10
2
5
8
3
5
13
The resulting PERT Chart
4
8
7
3
3
4
10
2
5
8
3
5
14
We can now work out

• the earliest time a task can start
• the earliest time a task can finish

Earliest Finish
Earliest Start
Task
15
Lets assume a start date of 0
4
8
7
3
0
0
0
3
4
10
2
5
8
3
5
16
4
8
7
4
3
0
0
0
4
3
4
10
2
4
5
8
3
5
17
7
4
8
7
4
7
7
3
0
0
0
4
3
4
10
2
9
4
5
9
8
3
5
18
14
7
14
4
8
7
4
7
7
10
3
0
0
0
4
3
4
10
2
9
4
5
9
17
8
17
3
5
19
14
7
14
4
8
7
4
7
7
10
3
0
0
0
4
17
3
4
10
2
9
4
5
9
17
8
17
3
5
20
14
18
18
7
14
4
8
7
4
7
7
10
3
0
0
0
4
17
27
3
4
10
2
9
4
5
9
17
8
17
20
20
3
5
21
14
18
18
26
7
14
4
8
7
4
7
7
10
3
0
0
0
4
17
27
3
4
10
2
9
4
5
9
17
8
17
20
20
25
3
5
22
14
18
18
26
7
14
4
8
7
4
7
7
10
3
0
0
0
4
17
27
27
29
29
29
3
4
10
2
9
4
5
9
17
8
17
20
20
25
3
5
23
We can now work out

• the latest time a task can start
• the latest time a task can finish

Task
Latest Start
Latest Finish
24
4
8
7
29
3
3
4
10
2
5
29
29
29
8
3
5
29
25
4
8
7
27
19
19
3
3
4
10
2
5
29
27
27
29
29
8
3
5
27
22
22
26
4
8
7
27
19
19
15
3
3
4
10
2
17
5
29
27
27
17
29
29
8
3
5
27
22
22
19
27
4
8
7
27
19
19
15
15
8
3
3
4
10
2
17
14
5
29
27
27
17
29
29
8
9
4
3
5
17
9
27
22
22
19
28
4
8
7
27
19
19
15
15
8
3
3
4
10
2
8
5
17
14
5
29
27
27
17
4
0
0
0
29
29
8
9
4
3
5
17
9
27
22
22
19
29
The Resulting PERT Chart
14
18
18
26
7
14
4
8
7
4
7
27
19
19
15
15
8
3
0
0
0
4
7
10
17
27
27
29
29
29
3
4
10
2
8
5
4
9
17
14
5
9
17
29
27
27
17
4
0
0
0
29
29
8
17
20
20
25
9
4
3
5
17
9
27
22
22
19
30
Now we can work out the slack for each task

• slack is the amount of time a task can be delayed
  without delaying other tasks or the project
  finish time
• take the earliest start from the latest start
• 7 - 7 0 Slack

7
10
3
Task
0
10
7
31
14
18
18
26
7
14
4
8
7
1
1
1
4
7
27
19
19
15
15
8
3
0
0
0
4
7
10
17
27
27
29
29
29
1
3
4
10
2
8
5
7
0
0
0
4
9
17
14
5
9
17
29
27
27
17
4
0
0
0
29
29
0
8
17
20
20
25
0
9
4
3
5
17
9
2
2
27
22
22
19
32
G
J
1
1
D
1
B
1
E
7
0
0
0
0
0
K
I
2
2

• Tasks B, D, G and J have a slack of 1

33
G
J
1
1
D
1
B
1
E
7
0
0
0
0
0
K
I
2
2

• Tasks B, D, G and J have a slack of 1
• Task E has a slack of 7

34
G
J
1
1
D
1
B
1
E
7
0
0
0
0
0
K
I
2
2

• Tasks B, D, G and J have a slack of 1
• Task E has a slack of 7
• Tasks I and K have a slack of 2

35
3
3
3
3
7
A
H
L
0
0
0
C
0
F
0
2
2

• Tasks A, C, F, H and L have zero slack
• This is the CRITICAL PATH

36
The Critical Path

• is the longest path through the PERT Chart
• all tasks along the Critical Path have the same
  slack
• if any tasks along this path are delayed during
  the project the finish time will be delayed

37
Summary

• by using a PERT Chart you can view the critical
  path
• by using a PERT Chart you can see how long
  individual tasks can be delayed before the finish
  of the project is delayed - the slack
• tasks can be delayed within their slack without
  causing the project to over-run on time