See what we can offer to your school
"SimpleStudy just makes sense...”
Get the best plan for your school
10 cards from this deck
Longest path through network; determines minimum project duration
Zero
Earliest time an event can occur
Latest time event can occur without delay
EFT=EST+Duration\text{EFT} = \text{EST} + \text{Duration}EFT=EST+Duration
LST=LFT−Duration\text{LST} = \text{LFT} - \text{Duration}LST=LFT−Duration
Float=LFT−EFT\text{Float} = \text{LFT} - \text{EFT}Float=LFT−EFT
Activities with zero float
⌈Total Activity TimeProject Duration⌉\lceil \frac{\text{Total Activity Time}}{\text{Project Duration}} \rceil⌈Project DurationTotal Activity Time⌉
max(EFT of preceding activities)\max(\text{EFT of preceding activities})max(EFT of preceding activities)
Select your subjects, and get access to A+ resources today.