Interval Scheduling: Greedy AlgorithmsGreedy template. Consider jobs in some natural order. Take each job provided it's compatible with the ones already taken.
[Earliest start time] Consider jobs in ascending order of sj. [Earliest finish time] Consider jobs in ascending order of fj. [Shortest interval] Consider jobs in ascending order of fj - sj. [Fewest conflicts] For each job j, count the number of conflicting jobs cj. Schedule in ascending order of cj.