NETWORK

DIAGRAM
CONSTRUCTION SCHEDULING

Michelle G. Galarion
 Key Principles for Planning and
Scheduling
1. Begin plan before starting work, rather than after starting work.

2. Involve people who will actually do the work in the planning and scheduling process.

3. Include all aspects of the project: scope, budget, schedule, quantity and safety.

4. Build flexibility into the plan, include allowance for changes and time for reviews and
approvals.

5. Remember the schedule is the plan for doing the work and it will never be precisely
correct.

6. Keep the plan simple, eliminate irrelevant details that prevent the plan from being
readable.

7. Communicate the plan to all parties, any plan is worthless unless it is known.
In planning, the logical sequence of the job to be performed must be formalized under the
following considerations:
• The logic of its sequence must be reviewed for correctness
• A further review should be entertained to ascertain that all phases of works should
appear
• That the scope of work is correctly interpreted

The project manager’s objective in planning could be summarized as follows:

• To represent graphically the specific job and the power sequence of the job
• To establish a medium for estimating the time, manpower or other resources
necessary for each job
• To have available sequential arrangement of the jobs, an accurate estimate of
resources and the alternative plans based on the scope of work

Basically, scheduling is only secondary to planning. It is the allocating of calendar dates to

jobs based on approved plan.

Example: Planning is putting 30 days in activity A.

Scheduling is specifying March 1-30 as the duration of activity A.
 TECHNIQUES FOR PLANNING
Bar Charts

• Illustrates the start

and finish dates of
the terminal
elements and
summary elements
of a project

• Developed by Henry
L. Gantt during
WWI
CPM (Critical Path Method)

• Developed in 1956 by the Du Pont Company with

Remington Rand as consultants

• Provides interrelationships of activities and

scheduling of costs and resources

• Emphasizes on the activities to be managed

PERT (Program Evaluation Review Technique) PERT / CPM

• Developed in 1957 by US Navy with Booz, Allen & • Control tool from defining the parts
Hamilton Management Consultants of the construction job and putting
them together in a network form
• Developed as a result of looking for an improved
method of planning & evaluation progress of a • A tool that will tell the management
large scale research and development program how to build a project on a pre-
determined activities and number of
days at a projected cost
 i , j = event numbers
ES = early start
i A=d j EF = early finish (ES + d)
LS = late start
ES LS EF LF LF = late finish (LS + d)
LS EF
A = activity
d = duration
ES = The early start of time activity. This is assuming that all preceding activities start at
the earliest time.
EF = Early finish of time activity
LS = Latest time of the activity can start and not delay the project
LF = Latest time the activity can finish and not delay the project
TF = Total Float. Span of time an activity can be delayed after its earliest start time without
delaying the project completion
FF = Free Float. Span of time an activity can be delayed after its earliest start time without
delaying the earliest start of any succeeding activity

Activity Duration ES EF LS LF TF FF Remarks

 Perform the Forward Pass.
Fill up all the Early starts
1 A=d 2 and Early Finishes

ES LS LS EF EF LF
Perform the Backward
Pass. Fill up all the Late
Finishes and Late Starts
FOR EXAMPLE:
12 - 12 20 - 8
1 A = 12 2 B=8 3

0 0 0 12 12 12 12 20 20 20

0 + 12 12 + 8
All activities passing
The EF of previous For the last event, To check, first thru events with the
activity becomes the ES EF is equal to LF. activity should same ES / LS are
of the next activity have the same ES considered to be in the
and LS CRITICAL PATH.
 Fill in the summary
1 A=d 2 table.
ES LS LS EF EF LF
CRITICAL PATH: A-B

1 A = 12 2 B=8 3

0 0 0 12 12 12 12 20 20 20

Activity Duration ES EF LS LF TF FF Remarks

A 12 0 12 0 12 0 0 C
B 8 12 20 12 20 0 0 C

For checking, all activities with TF = LS – ES or LF - EF

In the remarks section, we put “C” if
the activity is in the critical path and TF and FF equal to zero are
FF = ES of next activity
“NC” if not. activities within the critical path.
– EF of current activity
PROBLEM
EXERCISES
NETWORK DIAGRAM
 As discussed from the previous
Example 1 from the previous lecture (Network Fundamentals)
lecture, Critical Path is A-C-D-I-J
Perform the forward pass
1 A=4 2 B=5
Wait for Activity D before
0 4 4 9 deciding what to put in event 7
4+5

?
During the forward pass, if two
or more activities precede
0+4
C = 12 4 7 another activity, choose the
D=2
higher number as the earliest
16 16 18 18
start of the next activity.
4+12

16+2 18+12
I = 12 30

E=3 5 F=8 8 J=9

? 9
3 3 11 30 39 39

0+3 3+8
?
30+9
G=1 3 H=3 6 K = 15
1 1 4 4 19
0+1

1+3 4+15
Example 1 from the previous lecture (Network Fundamentals) Perform the backward pass

?
Wait for Activity C before

?
18-5
1 A=4 2 B=5 deciding what to put in event 2
During the backward pass, if two
0 0 0 4 4 4 13 9
or more activities branch out
from a single activity, choose
the lower number as the late
C = 12 4 D=2 7 finish of the preceding activity.
4 16 16 16 16 18 18 18
4-4

18-2 I = 12 18 30 30-12
16-12

E=3 5 F=8 8 J=9 9

19 3 3 22 22 11 30 30 30 39 39 39

22-3 30-8 39-9

G=1 3 H=3 6 K = 15
20 1 1 21 21 4 4 24 24 19

39-15
24-3
Example from the previous lecture (Network Fundamentals) Take note of the events with
the same numbers (ES/LS or
EF/LF) below them.
1 A=4 2 B=5
0 0 4 4
Activities that pass
0 4 13 9
through these events are
said to be in critical
C = 12 4 D=2 7 path.
4 16 16 16 16 18 18 18

I = 12 18 30

E=3 5 F=8 8 J=9 9

19 3 3 22 22 11 30 30 30 39 39 39

G=1 3 H=3 6 K = 15
20 1 1 21 21 4 4 24 24 19
 Fill in the summary table to
Example 2 from the previous lecture (Network Fundamentals) compute the free float and
total floats.
1 A=4 2 B=5 1 A=d
2
0 0 0 4 4 4 13 9
ES LS LS EF EF LF

C = 12 4 D=2 7
In the remarks section,
4 16 16 16 16 18 18 18 we put “C” or critical
if TF and FF is zero
and “NC” or non-
TF = LS – ES or LF - EF
I = 12 18 30 critical if not.
FF = ES of next activity – EF of current activity

E=3 5 F=8 8 J=9 9

19 3 3 22 22 11 30 30 30 39 39 39

Activity Duration ES EF LS LF TF FF Remarks

A 4 0 4 0 4 0 0 C
G=1 3 H=3 6 K = 15
B 5 4 9 13 18 9 9 NC
20 1 1 21 21 4 4 24 24 19
C 12 4 16 4 16 0 0 C
D 2 16 18 16 18 0 0 C
 Fill in the summary table to
Example from the previous lecture (Network Fundamentals) compute the free float and
total floats.
1 A=4 2 B=5 1 A=d
2
0 0 0 4 4 4 13 9
ES LS LS EF EF LF

C = 12 4 D=2 7
In the remarks section,
4 16 16 16 16 18 18 18 we put “C” or critical
if TF and FF is zero
and “NC” or non-
TF = LS – ES or LF - EF
I = 12 18 30 critical if not.
FF = ES of next activity – EF of current activity

E=3 5 F=8 8 J=9 9

19 3 3 22 22 11 30 30 30 39 39 39

Activity Duration ES EF LS LF TF FF Remarks

E 3 0 3 19 22 19 0 NC
G=1 3 H=3 6 K = 15
F 8 3 11 22 30 19 19 NC
20 1 1 21 21 4 4 24 24 19
I 12 18 30 18 30 0 0 C
J 9 30 39 30 39 0 0 C
 Fill in the summary table.
Example from the previous lecture (Network Fundamentals)

1 A=d
2
1 A=4 2 B=5
ES LS LS EF EF LF
0 0 0 4 4 4 13 9

C = 12 4 D=2 7 FF = ES of next activity

TF = LS – ES or LF - EF 4 16 16 16 16 18 18 18 – EF of current activity

Duration ES EF LS LF TF Remarks
18FF
Activity
I = 12 30

G 1 0 1 20 21 20 0 NC
E=3 5 8 J=9 9
H 3 1 4 21 24 F = 8 20 0 NC
19 3 3 22 22 11 30 30 30 39 39 39
K 15 4 19 24 39 20 20 NC

In the remarks
G=1 3 H=3 6 K = 15 section, we put “C”
or critical if TF
20 1 1 21 21 4 4 24 24 19 and FF is zero and
“NC” or non-
critical if not.
Activity Duration ES EF LS LF TF FF Remarks

A 4 0 4 0 4 0 0 C
B 5 4 9 13 18 9 9 NC
C 12 4 16 4 16 0 0 C
D 2 16 18 16 18 0 0 C
E 3 0 3 19 22 19 0 NC
F 8 3 11 22 30 19 19 NC
G 1 0 1 20 21 20 0 NC
H 3 1 4 21 24 20 0 NC
I 12 18 30 18 30 0 0 C
J 9 30 39 30 39 0 0 C
K 15 4 19 24 39 20 20 NC

How to interpret? Day 0 Day 1 Day 2 Day 3

For example, look at activity E which has 3 days duration. It

can start immediately (ES) and can finish it by day 3 (EF)
Or it can still start at day 19 (LS) and end by day 22 (LF) ACTIVITY E
without disrupting the whole duration of the project.
There are three ways to compute the critical path:

• By tracing all the paths leading from the first activity to the
last activity. The longest path is the critical path.

• By performing the forward and backward pass in an AOA

network diagram. Activities that pass through events with
the same numbers (ES/LS or EF/LF) below them are said to
be in critical path.

• By computing the total float and free float per activity.

Activities which show zero total float and free float are said
to be in the critical path.
Example 2 from the previous lecture (Network Fundamentals) As discussed from the previous
lecture, Critical Path is F-G-J-K
Perform the forward pass

Wait for K

1 F = 10 2 G = 10 3 I=6 ?
26 or 39? 39
6
0 10 10 20 20 26 39

Dummy = 0
0+10 10+10 20+6 K=7
20
39
20+0

32+7
H=8 4 J = 12 5
18 20 32 32

Wait
18 orfor dummy
20? 20

?
10+8
20+12
Example 2 from the previous lecture (Network Fundamentals) As discussed from the previous
lecture, Critical Path is F-G-J-K
Perform the backward pass

Wait for H

?
Wait for dummy

?
10 or 12? 10 20 or 33? 20

1 F = 10 2 G = 10 3 I=6 6
0 0 10 10 10 10 10 20 20 20 33 26 39 39

Dummy = 0
10-10 20-10 39-6 K=7
20 20 39-7
32 39

20-0
H=8 4 J = 12 5
12 18 20 20 20 32 32 32

20-8 32-12
Example 2 from the previous lecture (Network Fundamentals) Fill in the summary table.

1 F = 10 2 G = 10 3 I=6 6
0 0 0 10 10 10 10 20 20 20 33 26 39 39

Dummy = 0
TF = LS – ES or LF - EF
K=7
20 20
FF = ES of next activity 32 39
– EF of current activity
In the remarks section, we put “C” H=8 4 J = 12 5
or critical if TF and FF is zero and
12 18 20 20 20 32 32 32
“NC” or non-critical if not.

Activity Duration ES EF LS LF TF FF Remarks

F 10 0 10 0 10 0 0 C
G 10 10 20 10 20 0 0 C
H 8 10 18 12 20 2 2 NC
I 6 20 26 33 39 13 13 NC
J 12 20 32 20 32 0 0 C
K 7 32 39 32 39 0 0 C
Example 3 from the previous lecture (Network Fundamentals) Perform the forward pass
with corresponding activity duration

E = 12
27
Wait for H

?
15+12 27 or 25? 27
Wait
36 or for
35?J36
4 6 7

?
A = 15 2 D=5 F=3 5 H=2 I=9
15 15 20

Wait
? 20

for 20
B
23
?
23 25 27 36 36

20 or 10? 23 or for
Wait 10?G23
15+5 23+2 27+9
1 B = 10 20+3

0 10 J = 12
35
0+10
0+15

23+12
C=2 3 G=8
2 2 10

0+2
2+8
Example 3 from the previous lecture (Network Fundamentals) Perform the backward pass.
with corresponding activity duration

E = 12
15 27
27-12

?
Wait
15 for D
or 16? 15
Wait
25 or for
24?J24
2 4 6 7

?
A = 15 D=5 F=3 5 H=2 I=9
0 15 15 15 16 20 20 21 21 23 23 24 25 25 27 27 27 36 36 36

15-15 21-5 24-3 27-2 36-9

1 B = 10
0 0 11 10 J = 12

?
Wait
14, 11for
orB0?and
0 C
21-10
24 35

36-12
C=2 3 G=8
14 2 2 16 16 10 24-8

16-2
 Fill in the summary table to
Example 3 from the previous lecture (Network Fundamentals)
compute the free float and
with corresponding activity duration
total floats.
In the remarks section, we put “C” E = 12 TF = LS – ES or LF - EF
or critical if TF and FF is zero and
15 27 FF = ES of next activity
“NC” or non-critical if not.
– EF of current activity

A = 15 2 D=5 4 F=3 5 H=2 6 7

I=9
0 15 15 15 16 20 20 21 21 23 23 24 25 25 27 27 27 36 36 36

1 B = 10
0 0 11 10 J = 12
24 35
Activity Duration ES EF LS LF TF FF Remarks

A 15 0 15 0 15 0 0 C
E C=2 12 3 15 G = 8 27 15 27 0 0 C
D 14 2 5 2 16 15 16 10 20 16 21 1 0 NC
F 3 20 23 21 24 1 0 NC
 Fill in the summary table to
Example 3 from the previous lecture (Network Fundamentals)
compute the free float and
with corresponding activity duration
total floats.
In the remarks section, we put “C” E = 12 TF = LS – ES or LF - EF
or critical if TF and FF is zero and
15 27 FF = ES of next activity
“NC” or non-critical if not.
– EF of current activity

A = 15 2 D=5 4 F=3 5 H=2 6 7

I=9
0 15 15 15 16 20 20 21 21 23 23 24 25 25 27 27 27 36 36 36

1 B = 10
0 0 11 10 J = 12
24 35

Activity Duration ES EF LS LF TF FF Remarks

H 2 23 25 25 27 2 2 NC
C=2 3 G=8
I 9 2 16 27 36 27 36 0 0 C
14 2 16 10
B 10 0 10 11 21 11 10 NC
J 12 23 35 24 36 1 1 NC
 Fill in the summary table to compute
Example 3 from the previous lecture (Network Fundamentals) the free float and total floats.
with corresponding activity duration
Activity Duration ES EF LS
E = 12
LF TF FF Remarks

C 2 0 2 15 27
14 16 14 0 NC
G 8 2 10 16 24 14 13 NC

A = 15 2 D=5 4 F=3 5 H=2 6 7

I=9
0 15 15 15 16 20 20 21 21 23 23 24 25 25 27 27 27 36 36 36

1 B = 10
0 0 11 10 J = 12
24 35

TF = LS – ES or LF - EF FF = ES of next activity
– EF of current activity
C=2 3 G=8
In the remarks section, we put “C”
14 2 2 16 16 10 or critical if TF and FF is zero and
“NC” or non-critical if not.
Activity Duration ES EF LS LF TF FF Remarks

A 15 0 15 0 15 0 0 C
B 10 0 10 11 21 11 10 NC
C 2 0 2 14 16 14 0 NC
D 5 15 20 16 21 1 0 NC
E 12 15 27 15 27 0 0 C
F 3 20 23 21 24 1 0 NC
G 8 2 10 16 24 14 13 NC
H 2 23 25 25 27 2 2 NC
I 9 27 36 27 36 0 0 C
J 12 23 35 24 36 1 1 NC

Ways to determine the critical path:

1. All activities that with zero total float and zero free float are considered to be in critical path.
Critical Path: A – E – I = 36 days
 E = 12
15 27

A = 15 2 D=5 4 F=3 5 H=2 6 7

I=9
0 15 15 15 16 20 20 21 21 23 23 24 25 25 27 27 27 36 36 36

1 B = 10
0 0 11 10 J = 12
24 35

Ways to determine the critical path:

C=2 3 G=8 2. By performing the forward and backward

pass in an AOA network diagram. Activities
14 2 2 16 16 10 that pass through events with the same
numbers (ES/LS or EF/LF) below them are said
to be in critical path.

Critical Path: A – E – I = 36 days

 E = 12
15 27

A = 15 2 D=5 4 F=3 5 H=2 6 7

I=9
0 15 15 15 16 20 20 21 21 23 23 24 25 25 27 27 27 36 36 36

1 B = 10
0 0 11 10 J = 12
24 35
Paths:

C=2 3 Path 1: A – E – I = 15 + 12 + 9 = 36 days

G=8
14 2 2 16 Path 2: A – D – F – H – I = 15 + 5 + 3 + 2 + 9 = 34 days
16 10
Path 3: B – F – H – I = 10 + 3 + 2 + 9 = 24 days
Ways to determine the critical path:
Path 4: B – F – J = 10 + 3 + 12 = 25 days
• By tracing all the paths leading
Path 5: C – G – H – I = 2 + 8 + 2 + 9 = 21 days
from the first activity to the last
activity. Path 6: C – G – J = 2 + 8 + 12 = 22 days
LECTURE REFERENCE BOOK