Scheduling (Leaving Cert Applied Maths): Flashcards

Assigning workers to activities to achieve project objectives

Shortest completion time with unlimited workers available

Earliest possible time an event can occur

Latest time an event can occur without delaying project

Activities with zero total float that can't be delayed

$\text{Late time} - \text{Early time} - \text{Activity duration}$

Path formed by activities with zero total float

Visually displays when each activity should be scheduled

Count max number of activities happening simultaneously

$\frac{\text{Sum of activity times}}{\text{Critical time}}$

Assign activities in order of lowest late times

Use alphabetical order

Have float time, can be delayed without affecting project