- Horizontal bar chart plotting task start dates, durations, finish dates & milestones.
- Great for executive progress reporting and simple short-duration projects.
- Weakness: Does not cleanly highlight complex dependency chains or critical float math like network diagrams.
Schedule as the "Basis of Argument"
- Read left-to-right; every node except Start/End has predecessors & successors (uses dummy arrows in AOA if needed).
- 4 Constraints: Technical, Management, Interproject, and Date constraints.
- Enables mathematical Critical Path, Float, and Schedule Risk analysis.
From Mr Bhuru's Nov 2 Lecture
"Projects are the basis of argument; the schedule is the basis of argument" — it proves what happens when tasks slip or scope grows.
Precedence Dependencies & Passes
Calculates earliest dates left-to-right. When merging two or more predecessors, take the MAXIMUM (largest) Earliest Finish to set the successor's Earliest Start!
Calculates latest non-delaying dates right-to-left. When branching back to multiple successors, take the MINIMUM (smallest) Latest Start! Lead = negative lag (overlaps); Lag = forced delay.
Critical Path, Slack & Compression
- Sequence of activities where
ES = LSandEF = LF. - Any delay to a critical task delays the entire project completion date.
- Total Slack: Max delay before delaying project end.
- Free Slack: Max delay before delaying the next activity's ES.
- Assign extra staff/overtime to effort-driven critical tasks to shorten duration.
- Trade-off: Increases project labor cost, and fails on fixed-duration tasks (Brooks' Law risk!).
- Overlap phases normally done sequentially (e.g., start coding before final review sign-off).
- Trade-off: Increases rework and quality risk.
Probabilistic PERT Time & Variance
- Optimistic Time (a): Best-case duration if everything goes right.
- Most Likely Time (m): Realistic normal duration.
- Pessimistic Time (b): Worst-case duration if major delays hit.
CPM vs. PERT vs. Critical Chain
| Feature | CPM | PERT |
|---|---|---|
| Estimates | Deterministic (single time based on experience) | Probabilistic (3 estimates: a, m, b → expected date) |
| Use Case | Familiar, predictable tasks | Novel, uncertain work; caters for schedule risk |
| Focus | Critical vs. non-critical tasks, time-cost trade-offs | Realistic deadline probability & variance |
CCPM emphasizes resource dependencies and removes hidden per-task padding, consolidating safety into explicit buffers:
3 Buffer Types
Project Buffer (end of critical chain) • Feeding Buffer (where non-critical chains merge in) • Resource Buffer (alert flag, not time).
Penetration Action Triggers
1st Third: Monitor only • Middle Third: Investigate & make get-well plan • Final Third: Immediate corrective action.
Exam Skills: Network Grids & SD
- Be ready to: Calculate PERT expected duration
t_eand Standard Deviation for every task in a grid table. - Draw the network diagram from predecessor relationships (
A → B → C). - Fill the grid table for ES, EF, LS, LF, Total Float and highlight the Critical Path.
- Explain what happens when you deviate from the baseline plan!
- 1. Define all significant activities (single Start & single End).
- 2. Determine predecessor/successor precedence relationships.
- 3. Draw the network connecting all activities cleanly.
- 4. Assign deterministic (CPM) or 3-point (PERT) time estimates.
- 5. Compute Forward/Backward passes & longest Critical Path.
- 6. Monitor, control & crash if required at minimum cost.
Completed Concept 5: Scheduling, CPM & PERT
Next up: Earned Value Management (EVM) — PV, EV, AC, SPI, CPI, all EACs, TCPI & School Portal Case.