Critical path analysis Flashcards

1
Q

Find LB of workers

A

= sum durations of activities / critical time

Round up, even if next digit is below 5

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

If you are not given the early and late times of an activity network how can I find the criticial path?

A

Critical path is the longest to draw. Find the longest combination of arcs that get to the end. E.g. If most arc paths produce a path, 3 arcs long, the crtical path must be 4 arcs long.

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

Why are dummy activities needed?

A
  1. To show dependencies between activities
  2. Every activity must be uniquely represented in terms of its events. There must be at most one activity between any two events. So dummy needed at the end of one of two the activities.

(Exam question came up on the 2nd point phrased in mark scheme as: 2 activities cannot start at the same event and event at the same event so a dummy is needed at the end of the activity)

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

Early event time (choose the largest number)

A

the earliest time of arrival at the event allowing for the completion of all preceding activities

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

Late event time (choose the smallest number)

A

the latest that the event can be left without extending the time needed for the project.

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

Early event times uses forward/backward pass?

A

uses forward pass

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

Late event times uses forward/backward pass?

A

uses backward pass

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

The starting node aka

A

source node

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

The finishing node aka

A

sink node

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

If crtical activity times increase

A

the duration of entire project increases

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

Critical path

A

is a path from the source node to sink node that entirely folllows critical activities. This is the longest path in the network

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

Total float of an activity =

A

late event time - duration - early event time

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

Gantt (cascade) chart

A

graphically represents the range of possible start and finish times for all activities on a single diagram.

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

Gantt (cascade) chart and flexibilty in activities

A

no flexibility is illustrated for critical activities

total floats of each activity is represented by the range of movement of its rectangle on the chart

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

Resource histogram

A

displays the number of workers needed for an activity

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