Overview (Leaving Cert Applied Maths): Flashcards

Shortest route between two points in a network

Permanent label of zero

Always finds the truly shortest path

Identifies activities that cannot be delayed without delaying the project

Earliest possible moment an activity can begin

Latest an activity can start without delaying whole project

Breathing room in schedule (difference between early and late times)

$\text{Late start} - \text{Early start} - \text{Duration}$

Lie on the critical path

Minimum project duration

Calculate early times from start to finish

Calculate late times from finish to start

Early time equals late time

Project timeline visually, showing when each activity occurs

Any segment of an optimal path must itself be optimal