Seonglae ChoFind maximal subset of mutually compatible jobs.
- Job j starts at and finishes at
- Two jobs compatible if they don't overlap.
Greedy selection for compatible jobs
- Earliest start time
- Shortest interval
- Fewest conflicts
- Earliest finish time - because of sorting
