Activity networks and critical paths

Activity networks and critical paths Flashcards

Spec DE1–DE4 · AQA A-Level Further Maths: Flashcards

Studying this course? Keep your progress in one place.

Flip each card. Be honest: the ones you mark Not yet come back first.

13 cards

Tap a card to flip it. Swipe right if you knew it, left if not.

See all 13 cards
What is an activity-on-node network?
A network in which each activity is a node, and arrows show which activities must be finished first.
What are immediate predecessors?
The activities that must finish before an activity can start, with none in between.
How is the earliest start time of an activity found?
The maximum of the earliest finish times of its immediate predecessors (0 if it has none).
How is the earliest finish time found?
Earliest start time plus duration.
What is the minimum completion time?
The largest earliest finish time, the length of the longest path.
How is the latest finish time of an activity found?
The minimum of the latest start times of its immediate successors.
How is the latest start time found?
Latest finish time minus duration.
How do you calculate float?
Latest finish minus earliest start minus duration (or latest start minus earliest start).
What is a critical activity?
An activity with zero float; delaying it delays the whole project.
What is a critical path?
A path of critical activities from start to end whose length equals the minimum completion time.
Can a project have more than one critical path?
Yes.
What happens if a non-critical activity is delayed by more than its float?
The project is delayed by the excess over the float.
When does shortening an activity reduce the project time?
Only if it lies on every critical path, and only until another path becomes critical.

Flashcards