Earliest finish of an activity is always:
- AGreater than earliest event time of the following node
- BLess than earliest event time of the following node
- CLess than or equal to earliest event time of the following nodeCorrect
- DGreater than or equal to earliest event time of the following node
Solution
Concept
Earliest finish and event time
Formula
EF ≤ TE of head event
Step-by-step solution
1. The earliest event time of a node is the maximum of the EFs of all activities entering it. 2. So the EF of any one activity is less than or equal to it.
Explanation
Equality holds for the activity on the longest path into the node.
Why the other options are wrong
A and D would give a larger EF than the event time.
Shortcut
TE = max(EF) of preceding activities.
Correct answer: C) Less than or equal to earliest event time of the following node