Critical Path Analysis (Edexcel A-Level Further Mathematics): Flashcards

Longest path through network; determines minimum project duration

Zero

Earliest time an event can occur

Latest time event can occur without delay

$\text{EFT} = \text{EST} + \text{Duration}$

$\text{LST} = \text{LFT} - \text{Duration}$

$\text{Float} = \text{LFT} - \text{EFT}$

Activities with zero float

$\lceil \frac{\text{Total Activity Time}}{\text{Project Duration}} \rceil$

$\max(\text{EFT of preceding activities})$