- Given: A set of jobs, each given a start time si and a finish time fi
- Objective: Maximize the number of scheduled jobs
- Algorithm: repeatedly choose from the remaining jobs the one with
the earliest finish time
- Claim: Optimal results
Example: (1,5), (4,7), (6,9), (8,12), (13,15), (10,16)