TAIL EVENT SLACK [TES]
The tail event slack of an activity in a network is the slack at the tail (or starting point) of an activity. In other words, tail event slack of an activity in a network is the difference between the latest event time and the earliest event time at its tail (or starting point or node). In may be noted that TES should be calculated with the help of network after calculating the
earliest time (E) and Latest Time (L).
Example II –
In the aforesaid Example I, TES of various activities are computed as under:
Activity
| LES = L–E at tail (or starting point or node)
|
1-2
| 0 – 0 = 0
|
1-3
| 0 – 0 = 0
|
1-4
| 0 – 0 = 0
|
2-5
| 9 – 2 = 7
|
3-5
| 4 – 4 = 0
|
4-6
| 12 – 3 = 9
|
5-6
| 10 – 10 = 0
|
HEAD EVENT SLACK (HES)
The head event slack of an activity in a network is the slack at the head (or terminal point) of an activity. In other words, head event slack of an activity in a network is the difference between the latest event time and earliest event time at its head (or terminal point or node). It may be noted that HES should be calculated with the help of network after calculating Earliest
Time (E) and Latest Time (L).
Example I –
For the above network, HES of various activities are computed as under:
Activity
| HES = L– E at head (or terminal point or node)
|
1-2
| 9 – 2 = 7
|
1-3
| 4 – 4 = 0
|
1-4
| 12 – 3 = 9
|
2-5
| 10 – 10 = 0 ...
|
[Skip Breadcrumb Navigation]
Home
|
| Chapter 18
|
| Practice Quiz
|
This activity contains 10 questions.
|
|
|
|
| In the context of engineering projects
|
|
|
|
|
|
|
|
|
|
|
|
|
| A Gantt chart is a tool for
|
|
|
|
|
|
|
|
|
|
|
|
|
| At the end node of a CPM graph, the earliest event (EE) time is
|
|
|
|
|
|
|
|
|
|
|
|
|
| The critical-path method includes
|
|
|
|
|
|
|
|
|
|
|
|
|
| The main requirement for applying the critical path method (CPM) on a project is that
|
|
|
|
|
|
|
|
|
|
|
|
|
| At a CPM node, the earliest event (EE) time is
|
|
|
|
|
|
|
|
|
|
|
|
|
| At the start event of a CPM graph, the earliest event (EE) time is
|
|
|
|
|
|
|
|
|
|
|
|
|
| At a CPM node, the latest event (LE) time is
|
|
|
|
|
|
|
|
|
|
|
|
|
| A critical path in a CPM graph is
|
|
|
|
|
|
|
|
|
Answer choices in this exercise appear in a different order each time the page is loaded.
What is the difference between latest event time and the earliest event time?
Since the difference between the latest Start time & earliest start time of an activity is usually called as total float.
What is the earliest start time rule?
What is the earliest start time rule? A. It compares the activity's starting time for an activity successor.
What is earliest and latest time in CPM?
EF - earliest finish time, equal to the earliest start time for the activity plus the time required to complete the activity. LF - latest finish time: the latest time at which the activity can be completed without delaying the project.
How do you calculate LST and LFT?
Step 2 - Finding the LST (latest start time):
Task LST = (LFT – Task duration). Example: LST of Task 1 = (Task 1 LFT - Task 1 Duration).