D1 - Critical Path Analysis Flashcards

0
Q

How do you provide a visual representation of the information given in a precedence table?

A

Create an activity network.

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

What is a precedence/dependence table?

A

How activities are shown that can only be started once others are completed.

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

What is the completion I an activity?

A

An event.

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

Describe how you create an activity on arc network.

A

The activities are arcs.
The events are nodes.
The nodes are numbered from 0, this is the source node.
The final node is the sink node.

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

Describe dummy activities.

A

Shown by a dotted line, it has no time or cost involved.

Can only be one activity between two events.

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

What is the early event time?

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
6
Q

What is the late event time?

A

Is the latest time 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
7
Q

How are early event times calculated?

A

Using a forward pass.
Start at the source node and work out all routes to the sink node.
The largest route is the early event time.

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

How do you calculate the late event time?

A

Backward pass.
Make the early event time the late event time at the sink node.
Work backwards and always use the smallest route possible at each node.

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

What is a critical activity?

A

An activity where an increase in it’s duration results in a corresponding increase in the duration of the whole project.

(All the nodes in a critical path)

The early and late event time will be equal on critical activities.

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

What is a critical path?

A

The longest path contained in the network.

Consists of critical activities.

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

What is the total float?

A

Latest finish time - duration - earliest start time.

The amount of time that it’s start may be delayed without affecting the duration of the project.

Any delay in a critical activity will affect the project. Total Float = 0

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

What provides a graphical way to represent the range of possible start and finish times for all activities on a single diagram?

A

A cascade (Gantt) chart.

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

What is a scheduling program used for?

A

To show how tasks are allocated to workers in order to complete a project subject to constraints on the time required or the number of workers available.

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

How do you work out the lower bound for the number of workers needed?

A

Sum of all activity times/critical time of the project.

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