Welcome to Decision Making in Project Management!

Ever wondered how huge projects like building a skyscraper, filming a movie, or even planning a school prom stay on track? It’s all about Decision Making in Project Management. In this chapter, we use Discrete Mathematics to break down a big project into smaller tasks, figure out the order they must happen in, and identify which tasks are the most important for finishing on time.

Don't worry if this seems a bit overwhelming at first! We’ll take it step-by-step, and you’ll soon see that it’s just like following a very logical recipe.

1. Activity Networks: The Project Map

To manage a project, we first need to visualize it. We use an Activity Network. In this course, we specifically use the Activity on Arc (AoA) method.

Key Terms:

  • Arc: A directed line representing a specific task or "activity." Each activity has a name (like Task A) and a duration (like 5 days).
  • Node: A circle representing an "event." This is usually the start or the end of one or more activities.
  • Precedence: This just means "which task must come first." For example, you must bake the cake (Task A) before you can frost it (Task B).

Did you know? In an Activity on Arc network, the nodes don't actually take any time; they are just "milestones" in time!

Burst and Merge Nodes

  • Burst Node: A node where multiple activities start. Think of it like a fork in the road where one path splits into many.
  • Merge Node: A node where multiple activities finish. This is where different tasks come together before the next step can start.

Quick Review: In an Activity Network, Arcs = Tasks and Nodes = Start/End points.

2. The Forward Pass: Finding the Earliest Start Time (EST)

Once your network is drawn, you need to calculate times. We use a box at each node, usually split into two halves. The left half is for the Earliest Start Time (EST).

The Forward Pass is when you start at the first node (Time 0) and work your way to the end. It tells us: "What is the soonest we can possibly start the next task?"

How to do it:

  1. Start at the first node with an EST of \(0\).
  2. For each activity, add its duration to the EST of the node it started from.
  3. The Golden Rule for Merge Nodes: If two or more activities point into a node, you must choose the highest value. Why? Because you cannot start the next task until all preceding tasks are finished!

Example: Task A takes 3 days and Task B takes 5 days. If they both must finish before Task C starts, Task C cannot start until day 5.

3. The Backward Pass: Finding the Latest Finish Time (LFT)

Now we work backward from the final node to the start. We fill in the right half of the boxes with the Latest Finish Time (LFT). This tells us: "What is the latest we can finish this task without delaying the whole project?"

How to do it:

  1. Set the LFT of the final node to be the same as its EST. This is your minimum project completion time.
  2. Subtract the duration of the activity from the LFT of the node it points to.
  3. The Golden Rule for Burst Nodes: If an activity "bursts" back into multiple paths, you must choose the lowest value. We do this to ensure no subsequent path is delayed.

Memory Aid: Forward = Find the Max. Backward = Bring the Min.

Takeaway: The forward pass gives you the earliest possible finish date; the backward pass tells you how much "wiggle room" you have.

4. Critical Paths and Critical Activities

Some tasks are so important that if they are even one hour late, the whole project is late. We call these Critical Activities.

A Critical Path is a sequence of activities from start to finish where there is zero spare time. It is the longest path through the directed network.

How to spot them:

An activity is usually critical if:

  • The node it starts from has \( \text{EST} = \text{LFT} \).
  • The node it ends at has \( \text{EST} = \text{LFT} \).
  • The difference between the LFT (end) and EST (start) is exactly equal to the duration of the task.

Common Mistake: Students often think the shortest path is the best. In project management, the Critical Path is the longest path because it determines the absolute minimum time needed to finish everything.

5. Understanding Float

If a task is not critical, it has Float. This is essentially "spare time."

Total Float is the amount of time an activity can be delayed without delaying the entire project.

The Formula:

For an activity starting at node \(i\) and ending at node \(j\):

\( \text{Total Float} = \text{LFT}_j - \text{Duration} - \text{EST}_i \)

Analogy: Imagine you have an exam at 9:00 AM (LFT). It takes 30 minutes to drive there (Duration). It is currently 8:00 AM (EST). Your "float" is \( 60 - 30 = 30 \) minutes. You can lounge around for 30 minutes and still not be late for the exam!

Quick Review Box:
- Critical Activity: Float = 0.
- Non-Critical Activity: Float > 0.

Summary Checklist

To master this chapter, make sure you can:

  • [ ] Draw an activity network using Activity on Arc.
  • [ ] Identify Burst and Merge nodes.
  • [ ] Complete a Forward Pass to find the Minimum Completion Time.
  • [ ] Complete a Backward Pass to find Latest Finish Times.
  • [ ] Identify Critical Activities and the Critical Path.
  • [ ] Calculate the Total Float for any activity.

Don't worry if this seems tricky at first! The more networks you label, the more natural the "Max for Forward, Min for Backward" rule will feel. You've got this!