Critical Path Analysis Flashcards

1
Q

Precedence Table

A

Has the activities listed in the left column and their dependencies on the right.

  • Put a - where there are no dependencies
  • If an activity is dependent on an activity that depends on others only put the one it is directly dependent on
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Creating an activity network

A

Start with a node labelled 0
Point arcs representing activities that aren’t dependent on any others from there
Label each node with an increasing number. connect multiple arcs where one is dependent on multiple
Connect the terminating activity/activities to a sink node at the end
Arcs must be straight

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Dummy Arcs

A

Dotted lines from a node to another to show that the activity that is dependent on is needed for the one on the other end of the dummy

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

When do you need a dummy arc?

A
  1. Where two activities at the same node are needed, draw one to a separate node and add the dummy
  2. If an activity is needed for one activity on its own and another activity has that and another one needed, draw a dummy from the node where only it is needed
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Early event time

A

The earliest time a project can be started based on all events it is dependent on being completed

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Late event time

A

The latest time a project can be started without extending the time needed for a project

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Finding early and late event times

A

Trace forward from the source node for early, the latest time a needed event is completed
Trace back from the sink for the late, the earliest time from this

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Critical activity

A

Any increase in its duration will increase the duration of the whole project
Early start time = late start time where the values on the next node are equal to the values on that node plus the length of the activity

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Critical path

A

A path from the source node to the sink node that exclusively follows critical activities

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Float of an activity

A

The amount of time that its start may be delayed without affecting the duration of the project

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Float of an activity formula

A

latest finish time - duration - earliest start time

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Gantt Diagram

A

Shows the time each activity can be completed in visually using a diagram with rectangles for each activity

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Critical activities Gantt diagram

A

Rectangles across one line for all of them connected

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Non-critical activities Gantt diagram

A

Draw a rectangle from the early start time with length the duration. Draw a dotted rectangle from there to the late time.
Each should have a new line

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

When an activity must be at a time Gantt diagrams

A

No matter how far through the float it is shifted the rectangle will always encompass that time

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Day 10 Gantt diagram

A

Between lines 9 and 10

17
Q

Resource histograms

A
  1. Draw your critical path with time the x and workers the y
  2. Add non-critical activities from the earliest start time, they should be as low as possible, not necessarily as rectangles
  3. Write the letter of the activity in each small square
18
Q

Scheduling diagram

A

Looks like a Gantt chart

  1. The first worker does the critical path
  2. Fit each job where it can fit, choosing the one with the earliest late time when given a choice
  3. Shade in any gaps
19
Q

Lower bound for the amount of workers required

A

Sum of all the activity times / critical time of the project and round up to the nearest whole number

20
Q

Where the workers is fewer than the lower bound

A

Make a scheduling diagram from the activity network by inspection to minimise the run-time. Check for dependencies