Expand description
Critical Path Method Implementation
Textbook CPM algorithm operating on a SchedulingGraph.
References:
- Kelley & Walker (1959) “Critical-Path Planning and Scheduling”
- PMI PMBOK Guide, Chapter 6
§Algorithm
- Topological sort (done in dag.rs)
- Forward pass: Compute ES (Early Start) and EF (Early Finish)
- Backward pass: Compute LS (Late Start) and LF (Late Finish)
- Slack calculation: Slack = LS - ES (must be >= 0)
- Critical path: Tasks where Slack == 0
Structs§
- CpmResult
- Result of CPM scheduling for a single task
- CpmSchedule
- Complete CPM schedule
- CpmScheduler
- CPM scheduler operating on flattened graph
Enums§
- CpmError
- Errors during CPM scheduling