The

Network Diagram
From the following table of information, (a) Draw a
precedence diagram, (b) Find the Critical Path, (c)
Determine the expected duration of the project.
Activity Precedes Expected time (days)
a c, b 4
c d 12
d i 2
b i 5
e f 3
f j 8
i j 12
j end 9
g h 1
h k 3
k end 15
 Solution
:a. precedence
diagram
c=1 d=2
2 b=5
a=4 i =1
e=3 f =8 2

b. Critical g=1
Path
Path j =9
:a,c,d, i, j = 4+12+2+12+9 = h=3

a,b, i, j = 39 4+5+12+9 = k=1

5
= 30 c. expected duration of
e,f, j 3+8+9 =
= 20 the 39 days
g, h, k 1+3+15 =
project
The Network Diagram
• Every project is composed of works, activities,
tasks or functions that are related to one or
the other in some manner.
• The main goal is to finish the project under the
following objectives.

-To complete the project at the earliest minimum

time.
-To use any available manpower, equipment and
other
resources.
-To complete the project with a minimum capital

investment without causing u due delay.

Cont’d Network Diagram

• PERT/CPM utilizes all resources effectively

as possible.

• Time is considered as the controlling factor

in construction management.

-Time versus number of

manpower
-Time versus number of equipment

-Time versus Peso

Planning and Scheduling
• Planning is the logical sequence of the job to
be performed.
• Scheduling is the process of allocating
calendar dates to jobs based o the approved
plan.
Objectives of Project Manager in
Planning
• To represent graphically the specific job
and the proper sequence of the job.
• To establish a medium for estimating the time,
manpower or other resources necessary for
each job.
Cont’d Objectives of Project Manager in Planning
• To have available sequential arrangement of
the jobs, an accurate estimate of resources
and the alternative plans based on the scope
of work. of
Definition
Terms
• Critical
Path
– the longest route in the network of
activities
representing a project.
• Earliest
Event
– the earliest time occurrence of an event
sometimes called Earliest Event Time or
Early
Cont’d Definition of Terms
• Earliest
Start
- an activity cannot be earlier than the
earliest
time of the event.
i- j-node
node
• Early Start

– not necessarily the point in time that the

activity will be over, but it is the earliest
time
that it can occur.
Cont’d Definition of Terms
• Earliest
Finish
- is equal to its Earliest Start plus its
duration or time.

𝑬𝑺=𝑬𝑺+ 𝑫𝒖𝒓𝒂𝒕𝒊𝒐𝒏
𝑬𝑭 =𝑬𝒂𝒓𝒍𝒚 𝑬𝒗𝒆𝒏𝒕+𝑫𝒖𝒓𝒂𝒕𝒊𝒐𝒏
• Latest Event
Time
– is the latest time the event may occur
without
delaying project completion.
Cont’d Definition of Terms

• Latest
Finish
- An activity cannot be later than the
latest event time of its j-node.

𝑳𝑭 =𝑳𝑺+ 𝑫𝒖𝒓𝒂𝒕𝒊𝒐𝒏
𝑳𝑺=𝑳𝒂𝒕𝒆𝒔𝒕 𝑭𝒊𝒏𝒊𝒔𝒉 − 𝑫𝒖𝒓𝒂𝒕𝒊𝒐𝒏
Cont’d Definition of Terms
• Activity Total Float or Activity Total Slack
– is the span of time an activity can be
delayed
after its earliest start time without
delaying
𝑳𝑭 – 𝑬𝑭
the project =𝑻𝒐𝒕𝒂𝒍 𝑭𝒍𝒐𝒂𝒕
completion
)

𝑳𝑺 – 𝑬𝑺=𝑻𝒐𝒕𝒂𝒍 𝑭𝒍𝒐𝒂𝒕
Cont’d Definition of Terms

• Activity Free
Float
– is the span of time an activity can be
delayed
after its Early Start without delaying the
Earliest Start of any succeeding actual
activity
that may be availed of and still allow its
succeeding real activities to begin at their
Earliest 𝑭𝑭
Start time.
= 𝑬𝑺 – ( 𝑬𝑺+ 𝑫)
Cont’d Definition of Terms

• Independent
Float
– is that portion of the activities Free
Float
that would remain if all its preceding
activities
used up all their float.
𝑳𝑭 =𝑬𝑺 – ( 𝑳𝑭 − 𝑫)
Computing the Early Start and the Early Finish

Types of Information about the Network Activities

• ES = The Early Start of time activity.

• EF = Early Finish of time activity.

• LS = Latest time the activity can Start and

not delay the project.

• LF = Latest time the activity can Finish and

not delay the project.
Rules in Computing the ES and the EF
1. The Earliest Finish (EF) for any activity is equal
to its
earliest starting time plus its expected duration
time t. 𝑬𝑭 = 𝑬𝑺+ 𝒕
2. For nodes with one entering row, ES for
activities
at such node is equal to EF of the entering
arrow,
for nodes with multiple entering arrows, the
ES
Example:
Using the following network diagram,
compute for the value of ES and EF times.

1 8
Start 1 0 2 4

4
6 13

3 5 6 End
12 2
Figur
Solution:
𝟎 𝟏𝟎 The Early Finish (EF) of
Start activity 1-2 becomes the
ES
for the two activities 2-4
2-5 that follows it.
𝟔
Assume an Early Start ()
for activities without
predecessors. . Similarly, the EF of
The EF time for these activities activity 1-3 becomes
are: the
ES for activity 3-5.
𝑬𝑭 𝟏− 𝟐 ¿ 𝟎+𝟏𝟎
𝑬𝑭 𝟏− 𝟑=𝟎 +𝟔¿𝟔
 Cont’d Solution: Summar
𝟎 𝟏𝟎 𝟏𝟖 y: Duratio ES EF
Start Activity n
𝟎 𝟏𝟎
𝟐𝟑𝟐𝟐𝟐𝟓 𝟎 𝟔
End
𝟔 𝟏𝟖 𝟏𝟎 𝟏𝟖
𝑬𝑭 𝟏− 𝟐=𝟏𝟎 ; 𝑬𝑭 𝟏− 𝟑 =𝟔 𝟏𝟎 𝟐𝟑
𝟔 𝟏𝟖
𝑬𝑭 𝟐− 𝟒 ¿𝟏𝟎+𝟖 𝟏𝟖 𝟐𝟐
𝑬𝑭 𝟐− 𝟓¿𝟏𝟎 +𝟏𝟑 𝟐𝟑 𝟐𝟓
𝑬𝑭 𝟑− 𝟓 ¿ 𝟔+𝟏𝟐
𝑬𝑭 𝟒 −𝟓¿ 𝟏𝟖+𝟒 ¿ 𝟐𝟐
𝑬𝑭 𝟓− 𝟔¿ 𝟐𝟑+𝟐¿ 𝟐𝟓
Computing the Last Start and the Last
Finish
The Latest Start (LS) of an activity plus the
duration is equal to the Latest Finish (LF).

𝑳𝑺=𝑳𝒂𝒕𝒆𝒔𝒕 𝑭𝒊𝒏𝒊𝒔𝒉 − 𝑫𝒖𝒓𝒂𝒕𝒊𝒐𝒏

Example:
Determine the Latest Starting time (LS) and
the Late Finish (LF) for each activity of the
following network.
1 8
Start 1 0 2 4

4
6 13

3 5 6 End
12 2
Figur
Solution:
Solve for the values of LS
𝟏𝟗 going Backward from node
Start 6 staring from 25 weeks.
𝑳𝑺=𝑳𝒂𝒕𝒆𝒔𝒕 𝑭𝒊𝒏𝒊𝒔𝒉 − 𝑫𝒖𝒓𝒂𝒕𝒊𝒐𝒏
𝟐𝟑 𝟐𝟓
𝑳𝑺𝟓 −𝟔
End

For activity 5-6 to start not

It was found in the previous later than 23 weeks all
problem that and this EF is immediate predecessors
automatically becomes LF. must be finished not late
than that time.
𝑬𝑭 =𝑳𝑭 =𝟐𝟓 𝒘𝒆𝒆𝒌𝒔
𝑳𝑺𝟒 − 𝟓¿ 𝟐𝟑
 Cont’d Solution:
𝟎 𝟏𝟏 Summar
Start y:
𝟓 𝟏𝟎 Activity
Duratio LF LS
n
𝟐𝟓 𝟐𝟑
End
𝟔
𝟏𝟏 𝟏𝟖 𝟐𝟑 𝟏𝟗
𝑳𝑺𝟓 −𝟔 =𝟐𝟑; 𝑳𝑺 𝟒− 𝟓=𝟏𝟗 𝟐𝟑 𝟏𝟏
𝟐𝟑 𝟏𝟎
𝑳𝑺𝟑 −𝟓 ¿𝟐𝟑−𝟏𝟐 𝟏𝟗 𝟏𝟏
𝑳𝑺𝟐 −𝟓¿𝟐𝟑 −𝟏𝟑 𝟏𝟏 𝟓
𝟏𝟎 𝟎
𝑳𝑺𝟐 −𝟒 ¿ 𝟏𝟗
−𝟖
𝑳𝑺𝟏 −𝟑¿ 𝟏𝟏−𝟔 ¿𝟓
𝑳𝑺𝟏 −𝟐¿ 𝟏𝟎 −𝟏𝟎¿𝟎
The activity oriented CPM network diagram is made
under the following rules.
1. When an activity is the only predecessor of one or
more successors, the activity’s Early Finish (EF) is
equal to the Early Start (ES) of any of its successors.
2. When two or more activities have a common
successor,
the latter’s Early Start (ES) is equal to the
Latest
3. When an activity has only one successor
Early Finish (LEF) of its predecessors.
Activity, its
Latest Finish (LF) is equal to the Latest Start
(LS)
Cont’d The activity oriented CPM network diagram is
made under the following rules.

4. When two or more activities have only one

successor
activity, the Latest Start (LS) of the successor
activity is equal to the Latest Finish (LF) of any
of its
5.predecessor
When an activity has two or more successors,
activities.
the Latest Finish (LF) of the activity is equal to
the
Earliest of the Latest Start of its successor
activities.
Solving the Float or Slack Time
• The term SLACK is used by PERT which is
equivalent to FLOAT of CPM network system.
• Slack or Float is the word used for those
activities which do not fall o the critical path.
The Slack or Float Time is computed by using
either of the following equations:
Example:
From the following diagram, determine each of the
following:
a. The length of each path
b. The critical path
c. The amount of float time for each path

Figur
Solution:
0 10 18
Start

23 22 24
End
6 18 20 25
Path Length in weeks Float/
Slack
𝟏 −𝟐 −𝟒 − 𝟓− 𝟔 𝟏𝟎+ 𝟖+𝟒+ 𝟐=𝟐𝟒 𝟐𝟓 −𝟐𝟒=𝟏
𝟏 −𝟐 −𝟓 −𝟔 𝟏𝟎+ 𝟏𝟑+𝟐=𝟐𝟓C 𝟐𝟓 −𝟐𝟓=𝟎
𝟏 −𝟑 −𝟓 −𝟔 𝟔+𝟏𝟐 +𝟐=𝟐𝟎P 𝟐𝟓 −𝟐𝟎=𝟓
End