8 - Critical Path Analysis Flashcards
Define dependency.
When an activity can’t proceed until another is completed.
Define precedence/dependence table.
A table showing which activities must be completed before others are started.
What type of activity network do you use?
Activity on arc.
Define events.
Completion of activities.
What are the arcs and nodes on this type of activity network?
Arcs - activities.
Nodes - events.
What does each arc have?
.Activity letter label.
.Beginning/end at ends of arc.
.Arrow - direction.
.Straight line conventionally.
How do you draw an activity network?
.First node, labelled 0 is the source node.
.Number each node added to the network.
.Last node is the sink node.
What is a dummy activity?
No time/cost and shows dependency - dotted lines.
What are the two reasons to use a dummy activity?
.Show dependencies.
.Uniquely represented in terms of its events - one between any two events.
Define duration.
Length of time an an activity takes to complete - add arc weights.
Define EET.
Earliest time of arrival at an event in which all preceding activities are completed.
Define LET.
Latest time an event can be left without extending the time needed for the project.
How do you calculate EET?
Start from 0 at source nose and complete a forward pass towards sink node - Largest sum.
How do you calculate LET?
Start at sink node and complete a backward pass towards the source nose - smallest sum.
