Week 3 Flashcards

1
Q

What does the Project Programming /Scheduling consist of?

A
  1. Work Breakdown Structure. (Decompose project into a Work Breakdown Structure (WBS) defining Work Packages (WPs)).
  2. Activity Programming (WPs are defined so that resources, time (and cost) for each of them can be estimated, a process called WP Programming (or Activity Programming)).
  3. Project Logic Evaluation. (To assess project duration, it is necessary to develop suitable Network Logic - the relationships between different activities.)
  4. Network Analysis. (Once the logic has been determined, a Network Analysis/ Optimisation methods can be used to calculate project duration, etc. (Critical Path Method, CPM).)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What is the goal of Network Analysis?

A
  • Calculate completion time.
  • Calculate start and finish date for each activity.
  • Identify critical activities.
  • Identify requirements and flows of resources (materials, labour and equipment, £).
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Mention some Network Analysis methods.

A
  • Critical Path method (CPM).
  • Programme Evaluation Review Technique (PERT).
  • Monte Carlo Simulation.
  • Linear Scheduling Method (LSM).
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Explain CPM in detail.

A
  • Assumes fixed duration for each activity (i.e. WP)
    -Delivers:
    -Shortest completion time.
    • For each activity:
      -Earliest and Latest Start times (ES and LS) and
      consequently Earliest and Latest Finish times (EF and
      LF).
      • Float (F) available.
        -Critical Path.
  • Two representations:
    -Network Precedence Diagram.
    • Gantt Chart.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What are the different types of Precedence Relations?

A
  • Finish-to-Start (FS)
    Activity B must start efter Activity A is finished.
    -Start-to-Start (SS)
    Activity B must start when Activity A starts.
  • Finish-to-Finish (FF)
    Activity B must finish when Activity A finishes.
  • Start-to-Finish
    Activity B must finish when Activity A starts.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What is the procedure for CPM?

A
  1. Assign durations to activities in network diagram.
  2. Calculate ES and EF for each activity –> Completion time.
  3. Calculate LS and LF for each activity –> Total Float.
  4. Identify Critical Path.
  5. Identify resource requirements and potential problems.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

How do you calculate Total Float (TF)?

A

TF = LF - ES - D

TF = LS - ES

TF = LF - EF

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

What does TF=0 mean?

A

It means that there is no programming flexibility

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

Give examples of Activity Resources.

A
  • Time
  • Precedence
  • Labour
  • Material
  • Equipment
  • Space
  • Money
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

What can be done to combat resource constraints?

A

Software can address global resource constraints.

Planner can use artificial precedence to ensure resources are not needed simultaneously.

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

What are the consequences of Sub-optimality?

A

Due to a lack of consideration for resource demand over time, the project can have sub-optimal results. The consequences are:

  • Cost of unproductive resources in situation of underallocation.
  • Cost (and risk) of managing resource demand fluctuations. (Mobilisation/Demobilisation)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

What is Resource Levelling?

A
  • It balances resource demand over time.
  • Very important to enable smooth site operations.
  • Software can often not do that.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly