Network Diagrams Explained: Forward and Backward Pass

Welcome to understanding network diagrams in project management!A network diagram is a visual tool that shows how project activities are connected and depend on each other.Each activity is represented by a node or box containing important information about the task.Activities are connected by arrows that show the sequence and dependencies between tasks.The diagram flows from left to right, starting with the project beginning and ending with its completion.Let's examine the components of an activity node in detail.Each node contains the activity name at the top, and its duration in the center section.The arrows between nodes show dependencies and the flow of work, but don't represent time themselves.Here's a more complex network diagram showing multiple parallel paths and dependencies.Remember, network diagrams always flow from left to right, representing the progression of the project over time.In the next section, we'll learn how to calculate the earliest start and finish times for each activity.Let's perform a forward pass calculation to determine the earliest start and finish times for each activity.We'll use this formula: Earliest Finish equals Earliest Start plus Duration.We begin at time zero. The start node has no duration, so both earliest start and earliest finish are zero.Activities A and B can both start at time zero. Activity A has duration 4, so its earliest finish is 0 plus 4, equals 4.Similarly, Activity B has duration 3, so its earliest finish is 0 plus 3, equals 3.Activity C can start when A finishes at time 4. With duration 5, its earliest finish is 4 plus 5, equals 9.Activity D starts after B finishes at time 3. With duration 2, its earliest finish is 3 plus 2, equals 5.Activity E must wait for both C and D to finish. Since C finishes at 9 and D at 5, we use the larger value, 9, as the earliest start.Finally, the finish node can start when E completes at time 13. With no duration, its earliest finish is also 13.The forward pass reveals that the project will take at least 13 time units to complete.Now that we have completed the forward pass, let's calculate the backward pass to find the latest allowable times for each activity.We begin at the end activity E, using its earliest finish time of 12 as its latest finish time.To find the latest start time for E, we subtract its duration of 3 from its latest finish time.Activities C and D must finish before E can start, so their latest finish times equal E's latest start time of 9.The critical path emerges where earliest and latest times are equal, showing zero float activities.Float is the difference between latest and earliest times. Zero float activities must start on time to avoid delaying the project.Let's calculate the float for our remaining activities to confirm our critical path.Let's review the key points about backward pass calculation and critical path identification.Thanks for learning about network analysis with Spark.E!