TBPPE: Time Flashcards
Time (Scheduling) Management Step - Sequence Activities:
Identify and document the logical relationships between project activities
Time (Scheduling) Management Step - Estimate Activity Durations
Estimate the time required to complete each activity in the project
Time (Scheduling) Management Step -Develop Schedule:
Calculate the start and end times of the project activities and establish the overall project schedule baseline
Time (Scheduling) Management Common Tools:
1) Network Diagram
2) Gantt Chart
3) Project Calendar
4) Milestones
Network Diagram:
Shows the chronological relationship between scheduled activities (tasks) (which are typically derived from the WBS
Network Diagram - Early State (ES):
The earliest possible date on which an activity can start
Network Diagram - Late Start (LS):
The latest possible date that an activity may begin without delaying the project (or a milestone)
Network Diagram - Merge Activity:
An activity with two or more immediate predecessors (tasks flowing in)
Network Diagram - Burst Activity:
An activity with two or more immediate predecessors (tasks flowing out)
Network Diagram - Float (aka Slack, Total Float):
The amount of time an activity may be delayed from its early start without delaying the finish of the project. Float = (LS-ES) or (LF-EF)
Uses of Network Diagram Step - Forward Pass:
By path, start at the beginning, add all durations together. Result: Duration of project
Uses of Network Diagram Step - Backward Pass:
By path, start at the end, subtract all durations. Result: Float
Uses of Network Diagram Step - Path Analysis:
By path, review each path for least amount of float. Result: Critical path
3 Steps to apply the Forward Path:
1) Add all activity times along each path as moving forward (ES + Duration = EF)
2) Carry the EF time to the activity nodes immediately succeeding the recently completed node. The EF becomes the ES of the next node.
3) If the succeeding node is a merge point, the largest preceding EF becomes the ES for that node.
3 Steps to apply the Backward Path:
1) Subtract activity times along each path as moving backward (LF - Duration = LS)
2) Carry back the LS time to the activity nodes immediately preceding the recently completed node. The LS becomes the LF of the next node.
3) If the preceding node is a burst point, the smallest succeeding LS becomes the LF for that node