PERT (Program Evaluation and Review Technique)A project management tool used to schedule, organize, and coordinate tasks within a project. It uses a network diagram to visualize task dependencies and identify the critical path.
Critical PathThe longest sequence of dependent tasks that determines the minimum project duration. Tasks on the critical path have zero slack and any delay directly impacts the project completion date.
ES (Early Start)The earliest time a task can begin, based on the completion of all predecessor tasks.
EF (Early Finish)The earliest time a task can finish. Calculated as: EF = ES + Duration
LS (Late Start)The latest time a task can start without delaying the project. Determined through backward pass calculation.
LF (Late Finish)The latest time a task can finish without delaying the project. Calculated as: LF = LS + Duration
Slack (Float)The amount of time a task can be delayed without affecting the project completion. Calculated as: Slack = LS - ES (or LF - EF). Critical path tasks have zero slack.
Finish-to-Start (FS)The most common dependency type. The successor task cannot start until the predecessor task finishes.
Start-to-Start (SS)The successor task cannot start until the predecessor task starts. Both can run in parallel after the start.
Finish-to-Finish (FF)The successor task cannot finish until the predecessor task finishes. Often used for parallel tasks that must end together.
Start-to-Finish (SF)Rarely used. The successor task cannot finish until the predecessor task starts.
Lag TimePositive delay time added to a dependency. Example: painting can't start until 2 days after plastering finishes (drying time).
Lead TimeNegative lag time, allowing a successor to start before the predecessor finishes. Shown as negative lag value.
Three-Point EstimationA technique to calculate expected duration using three estimates: Optimistic (O), Most Likely (M), and Pessimistic (P). Formula: Duration = (O + 4M + P) / 6
Forward PassCalculation method moving from start to finish of the network to determine ES and EF for all tasks.
Backward PassCalculation method moving from finish to start of the network to determine LS and LF for all tasks.