The Short Class Trap
Four classes, drawn on a shared timeline:
| class | start | finish | duration |
|---|---|---|---|
| A | 0 | 10 | 10 |
| B | 9 | 12 | 3 |
| C | 11 | 20 | 9 |
| D | 20 | 25 | 5 |
Run the shortest-duration rule: repeatedly take the shortest remaining class, discard everything that conflicts with it, recurse. How many classes does it schedule, and what is the optimum?
Sign in to answer questions and track your progress
Sign In