Chapter 6 - Network Methods Flashcards

1
Q

What is the AON approach to scheduling?

A

Activity on Node

  • Each activity represented by a node
  • Project represented by network of nodes that are connected by arrows and arranged in sequence as specified by immediate predecessors
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What are activities in networks based on?

A

Work packages from the WBS

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

What is the main difference between PDM and AON networks?

A

AON assumes that a successor can commence immediately after an activity has finished
PDM shows kind of relationships between nodes, and allows the project manager to specify relationships like “5 days lag after activity for successor to start”

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

In terms of scheduling, what is a time-constrained project?

A

Project duration and completion time is fixed.

Resources are flexible. Additional resources may be required to complete the project on time

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

In terms of scheduling, what is a resource-constrained project?

A

Level of available resources fixed. Inadequate resources may delay project duration.

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

When working with a resource-constrained project, what is resource levelling?

A

The attempt to even out demands on resources by using slack on non-critical activities to manage resource utilisation

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

Why is it vital for a project manager to know the critical path of the project?

A

The critical path indicates:

  • Which activities need strict enforcement
  • Deadlines which are essential if the project is not to be delayed
  • Which activities are non-essential and may be delayed
  • Where resource scarcity can cause an activity to start after the ES time
  • Which activities need to be shortened
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Define the sensitivity of a network

A

The likelihood that the original critical path will change once the project is initiated

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

Is Chapter 6 mostly charts and little theory?

A

Yes

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

What are early times?

A

“The earliest activities can be started and finished
•Early times give only half the time information needed to create a realistic, feasible schedule
•Early times do not consider potential constraints”

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

What are late times?

A

“The latest times activities must be started or finished in order to complete project by target date
•To compute late times, start at last node in project, specify target completion, and work backwards
The late finish for an activity is based on late start for its successor.”

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

Quick way to determine duration of project?

A

Identify longest path through network from the start node to the end node

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

Slack times?

A

“Differnce between early and late times:
LS-ES or LF-EF
Represents scheduling flexibility, how much activity can be delayed/exceed expected duration”

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

Critical path?

A

“Path form start to end with LEAST total slack and longest path
Activities on CP are called critical activities
Any delay on activity on CP will delay project”

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

Total slack? Free slack?

A

“Total slack: Late times minus early times, and is the amount of time an activity can be delayed without delaying project
Free slack: amount of time an activity can be delayed without delaying at least one other activity”

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

PDM Networks?

A

“PDM (Precedence Diagramming Method) shows kinds of relationships in projects:
–Start activity when predecessors are only partiallycompleted
–Start activity n days after startof predecessor
–Start activity n days after predecessors are completed
–Finish activity n days after finished predecessor”