### Present Remotely

Send the link below via email or IM

• Invited audience members will follow you as you navigate and present
• People invited to a presentation do not need a Prezi account
• This link expires 10 minutes after you close the presentation

Do you really want to delete this prezi?

Neither you, nor the coeditors you shared it with will be able to recover it again.

You can change this under Settings & Account at any time.

# The Network Diagram

No description
by

## Jazmine Lanuza

on 29 January 2014

Report abuse

#### Transcript of The Network Diagram

The Network Diagram
Construction Methods and Project Management
Definition of Terms
Time
TIME
VS
Number of Manpower
Number of Equipment
Peso
Critical
Path

the longest route in the network of activities representing a project
the time required to complete a project is numerically equal to the length of the route
Earliest Event
earliest time an event can happen without delaying the
Earliest Start
of any activity
Earliest Start
always equal to the Earliest Event at the beginning of an arrow
i-node
j-node
Earliest Finish
not necessarily the point in time that the activity will be over, but is the earliest tie that it can occur.
EF = ES + Duration
Latest Event Time
the latest time the event may occur without delaying project completion
Latest Finish
an activity cannot be later than the latest event time of its j-node
LS = LF - D
LS + D = LF

Total Float
(Activity Total Slack)
the span of time an activity can be delay after its earliest start time without delaying the project completion.
LF - EF = Total Float
LS -ES = Total Float
Free Float
the span of time an activity can be delayed after its
Early Start
without delaying the Earliest Start of any
succeeding

real activities
to begin their Earliest Start time.
FF = ES - (ES + D)
Independent Float
numerically equal to the
ES
of the
succeeding real
activities minus the
LF
of the preceding activities minus the
duration
of activity in question
Free Float
is equals the
Early Event time
at the i-node of the
next succeeding
real activity minus the the

EF
of the activity
that portion of the activities Free Float that would remain if all its preceding activities used up all their float
I.F. = ES - (LF - D)
Computing the Early Start and Early Finish
After Determining the value of each activity we can proceed to find the following
Determine which activity falls under the Critical Path
Expected duration of the Project
The Slack Time
Rules in Computing the ES and EF
Rules No. 1
The Earliest Finish for any activity is equal to its earliest starting time plus its expected duration time.
Rules No. 2
For nodes with one entering arrow, ES for activities at such node is equal to EF of the entering arrow
Foe node with multiple entering arrow, the ES for activities leaving such node is equals the largest EF of the entering arrow
EF = ES + D
Here's an Example

0
10
10
8
18
4
13
6
6
12
18
23
22
2
25
Summary of the Above Computation
Activity
Duration
ES
EF
1 - 2
10
0
10
1 - 3
6
0
6
2 - 4
8
10
18
2 - 5
13
10
23
3 - 5
12
6
18
4 - 5
4
18
22
5 - 6
2
23
25
Full transcript