Welcome to Critical Path Analysis!
Ever wondered how massive projects like building a skyscraper, launching a rocket, or even organizing a huge music festival get done on time? They don't just "happen" – they are meticulously planned using Critical Path Analysis (CPA).
In this chapter, you’ll learn how to break a big project down into smaller tasks, figure out which tasks must be done first, and identify the "bottlenecks" that could delay the whole thing. Don't worry if it sounds complicated; we’ll take it one step at a time!
1. Building the Foundation: Activity-on-Node Networks
Before we can calculate times, we need a map of the project. In Discrete Mathematics, we use a precedence network. Specifically, for your AQA course, we use the Activity-on-Node method.
What is a Precedence Table?
Every project starts with a list of tasks (activities). Some tasks can't start until others are finished. This is called precedence.
Example: You can’t put your shoes on (Activity B) until you’ve put your socks on (Activity A). So, Activity A is a preceding activity for Activity B.
Drawing the Network
In an Activity-on-Node diagram:
1. Each Node (usually a box) represents a specific task.
2. Arrows show the flow of time and which tasks depend on others.
3. We usually include a "Start" node and a "Finish" node to keep things tidy.
Quick Tip: Always use a pencil! Drawing networks often requires a bit of rubbing out as you rearrange nodes to make the arrows look less like a bowl of spaghetti.
Key Takeaway: A precedence network is a visual map showing the order in which tasks must be completed.
2. The Forward Pass: Finding Earliest Times
Now that we have our map, we need to find the Earliest Start Time (EST) for each activity. We do this by moving left-to-right through the network (the Forward Pass).
How to calculate EST:
1. The Start node begins at time 0.
2. For any activity, the EST is the earliest time all its preceding activities can finish.
3. The Golden Rule: If a node has multiple arrows pointing into it, you must choose the highest (maximum) value. Why? Because the activity cannot start until the slowest preceding task is done!
Analogy: Imagine you are meeting three friends for a movie. You can’t go inside until the last person arrives. If they arrive at 6:00, 6:15, and 6:30, you can't start the movie until 6:30.
Quick Review:
Forward Pass = Finding Earliest times.
Rule = Take the Maximum value at a junction.
3. The Backward Pass: Finding Latest Times
Once we know the earliest the project can finish, we work backwards from right-to-left to find the Latest Finish Time (LFT). This tells us the latest a task can end without delaying the whole project.
How to calculate LFT:
1. Start at the Finish node. Its LFT is the same as its EST.
2. Work backwards, subtracting the duration of the activity.
3. The Golden Rule: If you are moving backwards and hit a junction where multiple arrows leave a node, you must choose the lowest (minimum) value.
Common Mistake: Students often forget to switch from "Max" to "Min" when going backwards. Remember: Forward = High, Backward = Low!
Key Takeaway: The backward pass tells us how much "wiggle room" we have for each task.
4. Critical Activities and the Critical Path
This is the "meat" of the chapter. A Critical Activity is a task that has absolutely no wiggle room. If it is delayed by even one second, the entire project is delayed.
How to spot a Critical Activity:
An activity is critical if:
\( \text{LFT} - \text{Duration} - \text{EST} = 0 \)
(In simpler terms: The Earliest Start Time and the Latest Start Time are exactly the same).
The Critical Path
The Critical Path is a continuous path of critical activities from the Start node to the Finish node.
Note: A project can have more than one critical path!
Did you know? Project managers focus almost all their energy on the Critical Path because that's where the risk is. If a non-critical task is delayed slightly, it usually doesn't matter!
5. Understanding "Float"
Tasks that are not on the critical path have what we call Float (or slack). This is the amount of time an activity can be delayed without delaying the whole project.
Calculating Total Float:
To find the float of an activity, use this simple formula:
\( \text{Total Float} = \text{LFT} - \text{Duration} - \text{EST} \)
Memory Aid: Think of "Float" like a "Safety Float" in a swimming pool. It’s the extra buoyancy you have before you "sink" the project schedule.
Quick Review Box:
- Critical Activity: Float = 0.
- Non-Critical Activity: Float > 0.
- Total Float: The total spare time available for a task.
6. Refining the Model: Real-World Changes
The syllabus (DE4) asks you to understand what happens when things change. In the exam, you might be asked: "What happens if Activity C takes 2 days longer than expected?"
Scenario Analysis:
1. If the delay is less than or equal to the Float: The project finish time stays the same.
2. If the delay is greater than the Float: The project will be delayed, and a new critical path might be created.
3. If a critical activity is delayed: The project is always delayed by that same amount.
Example: If you are cooking dinner and the "Boil Water" task is on the critical path, and the stove takes 5 minutes longer to heat up, dinner will be 5 minutes late. If "Set the Table" has 10 minutes of float and you take 5 minutes longer to do it, dinner is still on time!
Summary Checklist
Before you tackle practice questions, make sure you can:
- [ ] Draw a network from a precedence table (Activity-on-Node).
- [ ] Perform a Forward Pass to find Earliest Start Times (using the Max rule).
- [ ] Perform a Backward Pass to find Latest Finish Times (using the Min rule).
- [ ] Identify the Critical Path where Float = 0.
- [ ] Calculate the Total Float for any non-critical activity.
- [ ] Explain how a delay in a specific task affects the overall project.
Don't worry if this seems tricky at first! The more networks you draw, the more "automatic" the forward and backward passes will feel. You've got this!