See what we can offer to your school
"SimpleStudy just makes sense...”
Get the best plan for your school
10 cards from this deck
Calculates minimum time needed to complete a project
Maps tasks showing sequence, duration & dependencies visually
Soonest a task can begin
Choose longest time - task waits for all preceding tasks
Latest task can finish without delaying entire project
Work backwards: LFT at next node - task duration
Sequence of tasks determining overall project duration
EST = LFT at nodes AND longest route through network
LFT - EST - Duration
Time task can be delayed without delaying next task
Select your subjects, and get access to A+ resources today.