
Branch and Bound Scheduling Technique
PMBOK v8 Definition
Branch and bound is a technique used for project scheduling by systematically exploring and pruning potential schedules to find an optimal sequence of tasks that minimizes project completion time while satisfying all constraints. It works by breaking down a problem into smaller subproblems and using bounding functions to eliminate any subproblems that do not contain the optimal solution. This technique is applied within the Schedule Management performance domain.
Why It Matters for the Exam
The PMI exam frequently tests branch and bound as an advanced scheduling optimization technique, particularly in questions about finding optimal solutions under constraints. You will encounter it in situational questions where the project manager must select the best schedule among many possibilities, and in questions comparing it with other scheduling methods like critical path method or critical chain.
Key Points to Remember (for the exam)
- Core Mechanism: Systematically explores potential schedules while pruning (eliminating) those that cannot lead to an optimal solution
- Bounding Function: The key tool that evaluates each subproblem and determines whether it contains the optimal solution
- Primary Objective: Minimize project completion time while satisfying all constraints (dependencies, durations, resource allocations, milestones)
- Common Confusion: Branch and bound is NOT the same as critical path method—CPM finds the longest path, while branch and bound explores multiple schedule alternatives
- Key Input: Detailed information about dependencies, durations, resource allocations, and milestones based on the development approach selected
- Development Approach Fit: Can be used in both predictive and adaptive approaches, but requires sufficient detail to analyze subproblems
- Application Context: Most valuable when schedules are complex and there are many possible task sequences to evaluate
Typical PMI Exam Example
A project manager is developing a schedule for a complex construction project with 45 activities and multiple resource constraints. The team has identified several possible sequences of tasks. To find the schedule that minimizes total project duration while respecting all resource limitations, the project manager decides to use branch and bound. This technique systematically evaluates each possible sequence and eliminates those that cannot produce a shorter duration than the current best option.
PMI Exam Traps
-
Trap: Confusing branch and bound with rolling wave planning
- Reality: Rolling wave planning progressively elaborates details as the project unfolds; branch and bound systematically evaluates and prunes schedule alternatives
-
Trap: Thinking branch and bound is only for predictive (waterfall) projects
- Reality: It can be applied in adaptive approaches when there is sufficient time to analyze schedule alternatives
-
Trap: Assuming branch and bound always finds the absolute optimal solution
- Reality: It finds the optimal solution within the constraints and subproblems defined, but the quality depends on the bounding function and problem decomposition
-
Trap: Confusing branch and bound with schedule compression techniques (crashing, fast-tracking)
- Reality: Compression techniques modify activity durations or relationships; branch and bound explores existing alternatives without changing activity parameters
Important PMI Connections
| Related Concept | Relationship Type | Exam Attention Point |
|---|---|---|
| Critical Path Method (CPM) | Alternative technique | CPM finds the longest path; branch and bound explores alternatives to find optimal sequence |
| Schedule Compression | Complementary application | After CPM identifies the critical path, branch and bound can explore compression alternatives |
| Rolling Wave Planning | Opposite approach | Rolling wave plans progressively; branch and bound requires upfront analysis of alternatives |
| Adaptive/Flow-based Scheduling | Alternative context | Flow-based scheduling optimizes work flow; branch and bound optimizes task sequencing |
Quick Review Questions
-
What is the primary purpose of the bounding function in branch and bound scheduling?
-
A project manager has 20 activities with multiple possible sequences. Which technique would systematically eliminate non-optimal schedule alternatives?
-
How does branch and bound differ from the critical path method in terms of schedule optimization?
-
In which development approach (predictive or adaptive) is branch and bound most commonly applied, and why?
-
What information must be available before branch and bound can be effectively used for project scheduling?
PMBOK v8 Reference
Section 2 – Project Management Performance Domains (Schedule Management domain, Scheduling Tools and Techniques subsection)