Introduction: Managing Big Projects with Critical Path Analysis

Have you ever wondered how giant projects, like building a skyscraper or launching a new smartphone, are finished on time? It’s not just luck! Project managers use a technique called Critical Path Analysis (CPA).

In this chapter, you will learn how to break a big project down into smaller tasks, figure out which tasks depend on others, and calculate the absolute minimum time needed to finish everything. Don't worry if it seems like a lot of steps at first—once you master the "Forward and Backward Pass," it becomes a very logical puzzle!

1. Building the Model: Precedence Tables and Networks

Before we can calculate times, we need a map of the project. We use two main tools: Precedence Tables and Activity Networks.

Key Terms

  • Activity: A task that takes time and resources (e.g., "Paint the walls"). In our diagrams, activities are shown on arcs (the arrows).
  • Event: A specific point in time when activities start or finish. These are shown as nodes (the circles).
  • Precedence Table: A list showing each activity and its immediate predecessors (the tasks that must be finished before it can start).

The Rules of Activity on Arc (AoA) Diagrams

In the Pearson Edexcel D1 syllabus, we use the Activity on Arc method. Here are the "Golden Rules" for drawing them:

  1. Each activity is represented by one arrow.
  2. The nodes represent the "start" or "finish" of activities.
  3. Crucial Rule: Any two nodes can be connected by at most one activity.

The Mystery of "Dummies"

Sometimes you will need to draw a dashed arrow called a Dummy Activity. Dummies have a duration of zero. We use them for two reasons:

  • Reason 1 (Uniqueness): To ensure that each activity is uniquely identified by its start and end nodes. If two activities start and end at the same place, we use a dummy to separate them.
  • Reason 2 (Dependency): To show that an activity depends on some, but not all, of the preceding activities.
Analogy: Imagine you are making a sandwich. You must "Buy Bread" and "Buy Cheese" before you can "Assemble Sandwich." But you only need to "Buy Bread" to "Make Toast." A dummy would help show that "Assemble Sandwich" depends on both, while "Make Toast" only depends on the bread.

Quick Review: Activity networks flow from left to right. Every network must have a single "Start" node and a single "Finish" node.

2. The Forward and Backward Pass

Once your network is drawn, it’s time to do some math! We use nodes divided into sections to record two important times.

Step 1: The Forward Pass (Earliest Event Times)

We work from left to right to find the Earliest Event Time (EET). This is the earliest time that all activities leading into that node can be finished.

  • Start at the first node with \( EET = 0 \).
  • For each node, look at all activities pointing into it.
  • Calculate: \( \text{EET of previous node} + \text{duration of activity} \).
  • The Rule: If more than one activity leads into a node, choose the LARGEST value. (Because you can't start the next task until the slowest predecessor is done!)

Step 2: The Backward Pass (Latest Event Times)

We work from right to left to find the Latest Event Time (LET). This is the latest time an event can happen without delaying the whole project.

  • Start at the last node. Set the \( LET \) equal to the \( EET \) you just calculated.
  • For each node, look at all activities pointing away from it.
  • Calculate: \( \text{LET of next node} - \text{duration of activity} \).
  • The Rule: If more than one activity leads out of a node, choose the SMALLEST value.

Common Mistake to Avoid: Students often get confused about when to pick the "largest" or "smallest" number. Just remember: Forward = Max (waiting for everyone to finish) and Backward = Min (don't let anyone get late!).

3. Critical Paths and Floats

Now that we have our times, we can find the "bottlenecks" of the project.

Critical Activities

A Critical Activity is a task where any delay will immediately delay the entire project. For an activity to be critical, it must satisfy these conditions:

  1. It starts at a node where \( EET = LET \).
  2. It ends at a node where \( EET = LET \).
  3. \( \text{LET}_{\text{end}} - \text{EET}_{\text{start}} - \text{Duration} = 0 \).

The Critical Path is the continuous path from start to finish consisting only of critical activities. Highlight this path clearly in your exam!

Total Float

The Total Float is the amount of time an activity can be delayed without delaying the whole project. Critical activities have a float of 0.

The Formula:
\( \text{Total Float} = \text{LET}_{\text{end node}} - \text{EET}_{\text{start node}} - \text{Duration} \)

Memory Aid: Think of "Float" as "Spare Time." If you have a 2-hour window to do a 30-minute chore, your "float" is 1 hour and 30 minutes.

Key Takeaway: Identifying the critical path tells a manager exactly where they cannot afford to be late. Non-critical tasks can be shifted slightly if resources are limited.

4. Gantt Charts and Scheduling

A Gantt Chart (also called a Cascade Chart) is a visual way to represent the project schedule against a timeline.

How to Draw a Gantt Chart

  • The horizontal axis represents time.
  • Each activity is drawn as a horizontal bar.
  • Critical Activities: Usually placed at the top, forming a solid line of bars from time 0 to the project end.
  • Non-Critical Activities: These are drawn starting at their Earliest Start Time. We often use a shaded box or dotted line to show their Float.

Scheduling and Resource Histograms

Sometimes, an exam question will ask for the lower bound of workers needed. This helps us understand how many people are required to finish the project on time.

Lower Bound Formula:
\( \text{Lower Bound of Workers} = \frac{\text{Sum of all activity durations}}{\text{Critical path finish time}} \)

Note: Always round UP to the nearest whole number, because you can't hire half a person!

Did you know? Gantt charts were first used in the early 1900s to manage the construction of the Hoover Dam. Today, they are used in almost every industry from software development to wedding planning!

Summary: Your CPA Checklist

  • Draw the Network: Activities on arcs, circles for events, and use dummies for uniqueness or dependency.
  • Forward Pass: Find EETs by taking the maximum value at each node.
  • Backward Pass: Find LETs by taking the minimum value at each node.
  • Find Critical Path: Look for activities where \( \text{Float} = 0 \).
  • Calculate Float: \( \text{LET}_{\text{end}} - \text{EET}_{\text{start}} - \text{Duration} \).
  • Gantt Chart: Draw the schedule and show the "spare time" (float) for non-critical tasks.

Encouragement: Critical Path Analysis is one of the most practical parts of Decision Mathematics. Once you practice a few networks, you'll start seeing "critical paths" in your daily life—like the order you get dressed in the morning!