← Portal CONCEPT 05 Scheduling, CPM & PERT
01 / 06 • 00:00
5.1 Activity Planning & Scheduling Tools

Schedule as the "Basis of Argument"

GANTT CHARTSVISUAL BAR
Gantt
Who Does What & When
  • 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.
NETWORK DIAGRAMSPDM / AOA
Network
Precedence & Flow Graph
  • 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.

G91 LECTURE
5.2 Dependencies, Lead/Lag & Forward/Backward Pass

Precedence Dependencies & Passes

FS
Finish-to-Start
Task B cannot start until Task A finishes (most common, e.g., Code → Test).
SS
Start-to-Start
Task B cannot start until Task A starts (allows parallel overlap).
FF
Finish-to-Finish
Task B cannot finish until Task A finishes (e.g., Docs & Build).
SF
Start-to-Finish
Task B cannot finish until Task A starts (rare shift handovers).
FORWARD PASS (ES & EF)

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!

EF = ES + Duration (or ES + D − 1 in 1-indexed days)
BACKWARD PASS (LF & LS)

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.

LS = LF − Duration | Float = LS − ES = LF − EF
5.3 Critical Path Method (CPM) & Schedule Compression

Critical Path, Slack & Compression

CRITICAL PATHZERO SLACK
Float = 0
Longest Path Through Network
  • Sequence of activities where ES = LS and EF = 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.
COMPRESSION 1COST +
Crashing
Add More Resources
  • 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!).
COMPRESSION 2RISK +
Fast-Track
Run Sequential Tasks in Parallel
  • Overlap phases normally done sequentially (e.g., start coding before final review sign-off).
  • Trade-off: Increases rework and quality risk.
5.4 Program Evaluation & Review Technique (PERT)

Probabilistic PERT Time & Variance

3-POINT ESTIMATESUNCERTAIN WORK
  • 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.
Expected Duration: t_e = (a + 4m + b) / 6
PERT assigns 4× weight to Most Likely (m) in a Beta probability distribution.
STANDARD DEVIATION & VARIANCEEXAM MATH
Task SD: σ = (b − a) / 6
Task Variance: σ² = [(b − a) / 6]²
Path SD: σ_path = √( Σ σ_i² )
Never add task SDs directly! Sum the variances (σ²) along the critical path first, then take the square root.
5.5 PERT vs. CPM & Critical Chain (CCPM)

CPM vs. PERT vs. Critical Chain

PERT VS. CPM (MR BHURU NOTES)
FeatureCPMPERT
EstimatesDeterministic (single time based on experience)Probabilistic (3 estimates: a, m, b → expected date)
Use CaseFamiliar, predictable tasksNovel, uncertain work; caters for schedule risk
FocusCritical vs. non-critical tasks, time-cost trade-offsRealistic deadline probability & variance
CRITICAL CHAIN (CCPM) BUFFERS

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.

5.6 Exam Grid Checklist

Exam Skills: Network Grids & SD

FROM NOTAK (SCHSDULING)EXAM ALERT
  • Be ready to: Calculate PERT expected duration t_e and 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!
6-STEP PERT/CPM FRAMEWORKDCAP UNIT 9
  • 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.

Next: Concept 6 (EVM) →