(03) Developing the baseline network plan Flashcards
What is a Project Network Diagram?
A flow chart that graphically depicts the sequence, interdependencies and start and finish times of the project activities.
How does a Project Network Diagram work?
- Networks typically flow from left to right.
- Arrows indicate precedence and flow.
- An activity cannot begin until all of its preceding activities are complete.
- Identify each activity with a unique number.
- This number must be greater than its predecessors. - Looping is not allowed.
- Conditional statements are not allowed.
- Use common start and stop nodes.
Every activity on the network diagram must be completed for the project to finish.
What are the Benefits of a Project Network Diagram?
- Provides the basis for scheduling labour and equipment.
- Enhances communication among project participants.
- Provides an estimate of the project duration.
- Provides a basis for budgeting cash flow.
- Identifies the critical activities.
- Help managers get and stay on plan.
What is the terminology used (when Constructing a Project Diagram).
- Activity (or task).
- Path.
- Critical Path.
What is an activity (or task)?
An element of the project that requires time – e.g., A, B, C, D, etc.
What is a Path?
A sequence of connected, dependent activities.
What is a Critical Path?
The longest path through the network that allows for the completion of all project-related activities.
What is dependency?
Dependency relates to the sequencing of project activities.
What are the different types of dependencies?
- Mandatory Dependencies (Hard Logic).
- Discretionary Dependencies (Soft Logic).
- External Dependencies.
We must understand the type of dependencies required for each activity on our project.
What is a successor?
An activity that is done directly after another activity.
What are Mandatory Dependencies (Hard Logic)?
Inherent in the nature of the work itself – e.g., scrape off old paint, then apply primer, then paint the house.
What are Discretionary Dependencies (Soft Logic)?
Defined by the project team - e.g., paint room 1 first and then paint room 2.
What are External Dependencies?
Involve relationships between project and non-project activities – e.g., a shared hardware platform ordered by another department.
What is a predecessor?
An activity that is done directly before another activity.
What are the different types of dependency relationships?
- Finish-to-start relationship.
- Start-to-start relationship.
- Finish-to-finish relationship.
- Start-to-finish relationship.
What is a Finish-to-start relationship?
The subsequent activity cannot start until the preceding activity is finished.
- E.g. car manufacturing: painting can’t begin until the welding is finished.
What is a Start-to-start relationship?
The subsequent activity can start AFTER the preceding activity has started.
- E.g. trenching 1km and then laying the pipe while continuing the trenching activity for the next kilometre.
What is a Finish-to-finish relationship?
The finish of the subsequent activity depends on the finish of the preceding activity.
- E.g. testing the prototype can start while it is still developed, but has to finish after the prototype has been fully developed.
What is a Start-to-finish relationship?
The finish of the subsequent activity depends on the start of the preceding activity.
- E.g. the documentation of a system cannot finish before the testing has started.
What is the importance of Project Network Diagram?
- Drawing the project network diagram places the activities in the right sequence, but…
- We need to compute the start and finish times of the activities.
What are the two complementary approaches (of Project Network Diagrams?)
- Forward pass → earliest times
- Backward pass → latest times
What three questions do you need to answer (for forward pass computation?)
- How soon can the activity start?
- (early start – ES). - How soon can the activity finish?
- (early finish – EF). - How soon the project can be finished?
- (expected time – TE).
What three things do you need to remember (for forward pass computation?)
- Add activity times along each path in the network.
- (ES + duration = EF). - Carry the EF to the next activity, where it becomes ES, unless..
- The successor is a merge activity. If so..
- Select the largest EF of all its immediate predecessors.
What four questions do you need to answer (for backward pass computation?)
- How late can the activity start?
- (late start – LS). - How late can the activity finish?
- (late finish – LF). - Which activities represent the critical path (CP)?
- How long can the activity be delayed?
- (slack or float – SL).