Chapter 8: The Mathematics of Scheduling: Directed Graphs and Critical Paths
A successful student can...
- Understand and use digraph terminology.
- Schedule a project on N processors using the priority-list model.
- Apply the backflow algorithm to find the critical path of a project.
- Implement the decreasing-time and critical-path algorithms.
- Recognize optimal schedules and the difficulties faced in finding them.
