Send the link below via email or IMCopy
Present to your audienceStart remote presentation
- 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
- A maximum of 30 users can follow your presentation
- Learn more about this feature in our knowledge base article
Do you really want to delete this prezi?
Neither you, nor the coeditors you shared it with will be able to recover it again.
Make your likes visible on Facebook?
Connect your Facebook account to Prezi and let your likes appear on your timeline.
You can change this under Settings & Account at any time.
The Network Diagram
Transcript of The Network Diagram
Construction Methods and Project Management
Definition of Terms
Number of Manpower
Number of Equipment
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 time an event can happen without delaying the
of any activity
always equal to the Earliest Event at the beginning of an arrow
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
an activity cannot be later than the latest event time of its j-node
LS = LF - D
LS + D = LF
(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
the span of time an activity can be delayed after its
without delaying the Earliest Start of any
to begin their Earliest Start time.
FF = ES - (ES + D)
numerically equal to the
activities minus the
of the preceding activities minus the
of activity in question
is equals the
Early Event time
at the i-node of the
real activity minus the the
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
Summary of the Above Computation
1 - 2
1 - 3
2 - 4
2 - 5
3 - 5
4 - 5
5 - 6