Time Scheduling Flashcards
what is the definition of time scheduling
Time scheduling is a collection of techniques used to develop and present schedules that show when work will be performed.
and
Scheduling is the process used to determine the overall project duration and when activities and events are planned to happen. This includes identification of activities and their logical dependencies, and estimation of activity durations, taking into account requirements and availability of resources.
what are the 7 steps of the project planning process
- defining the project scope through the use of a work breakdown structure
- identify the activities required to create work packages then determine their logical sequence
- estimating the durations of activities thereby allowing a schedule to be created
- determining the resources required and their availability
- estimating the cost of the resources allowing a cost budget to be created
- throughout this process, other constraints must be taken into account such as risk, quality, procurement and HSE
- this process will culminate in a baseline plan for the project being created. Note that the above steps are not sequential and multiple iterations of each step are likely to be required.
what are Precedence Diagramming Method (PDM) or Activity-on-Node (AoN) networks diagramming.
This method represent the activities as boxes or nodes with relationships shown as the logic connections between the boxes.
what are the 4 types of logical relationships
Finish-to-Start - Predecessor activity must finish before the successor activity can start (most common relationship)
Start-to-Start - Predecessor activity must start before the successor activity can start
Finish-Finish - Predecessor activity must finish before the successor activity can finish
Start-to-Finish Successor activity must start before the predecessor activity can finish (very rare)
Network diagrams can be further enhanced through the addition of lags and leads to specific logical links - what are they
Lag: creates a defined delay in the relationship (represented by the inclusion of a ‘+’ sign accompanied by the required time delay). Lags can be used on all 4 relationships
Lead: indicates an overlap between two linked activities (represented by the inclusion of a ‘-’ sign accompanied by the required time overlap), they can only be used with Finish to Start activities
how is a network diagram node depicted
ES | D | EF ------------------------ ID DESCRIPTION ------------------------- LS | TF | LF
ES = Earliest Start D = Activity Duration EF = Earliest Finish LS = Latest Start TF = Total Float LF = Latest Finish
what is the Forward Pass - left to right
this pass calculates the earliest possible start and finish times for each task
Forward Pass:
Early Finish = Early Start + Duration (ES + D)
what is the Backward Pass
this pass calculates the latest possible start and finish dates which will complete the schedule on time
Backward Pass:
Late Start = Late Finish – Duration (LF – D)
Where a successor task on the forward pass has two predecessors, which ‘EF’ must be chosen,
the latest ‘EF’ must be chosen, that is, the EF with the higher value.
When a predecessor task on the backward pass has two successors which ‘LS’ value is used.
the smallest ‘LS’ value is used.
what helps remember the predecessor / successor rule
To help you remember ‘Highest number forward, lowest number back’, think ‘Big steps forward, small steps back’.
what are the 2 types of float generally considered
Total Float: The amount of time an activity can be delayed or extended without affecting the total project duration (end date).
Free Float: The amount of time an activity can be delayed or extended without delaying the start of the succeeding activity.
how is total float calculated
Total Float: If the activity has a simple Finish to Start dependencies with predecessors and succeeding activities, the following formulae may be used: Total Float = Late Finish – Early Finish (LF – EF) = Late Start – Early Start (LS – ES)
how is free float calculated
Free Float:
Free Float = Early Start of next task – Early Finish of current task
Where a task has two successors the time difference between the tasks may be different; the free float (if any) will be the lower of the two numbers calculated.
what is the definition of the Critical Path
Sequence of activities through a project network from start to finish, the sum of whose durations determines the overall project duration.
It is identified on a network diagram as the path with the least total float, but generally has zero total float.
the longest path through the network
the shortest possible planned project duration