Three uses
PERT charts are generally used to calculate the critical path
3.1 The concept of critical path
The critical path refers to the sequence of events and activities that takes the longest.
Explanation of related concepts:
①Earliest start time: the sum of the longest input streams before the start point of a certain project
②Latest start: the critical path - the distance from the start point to the final end point of the entire project
③Earliest end: the end point of a certain project The sum of the longest input stream before
④ the latest end: critical path - the distance from the end point to the last end point of the entire project
3.2 Calculation of critical path
1. Critical path: Among all the paths from the beginning to the end, the one with the longest talking time is the critical path.
Note: Tasks on the critical path have a slack time of 0.
Earliest start time: On the critical path, the time from start to the earliest execution of the task.
Latest start time: The total time of the critical path - working backwards to get the task's Time
2. Slack time (the time that delays execution at most)
The first way to find it: the latest start time - the earliest start time
The second way to find it: the total time of the critical path - the time spent on the critical path including the task
Reference: Soft Exam – Critical Path Method
3.3 Algorithm implementation of critical path
This is well written and can be used as
a basis for a reference diagram - critical path understanding and implementation (Java)