In the Greedy Activity Selection problem, which heuristic is proven to yield an optimal solution?

Earliest finish time

Choosing the activity that finishes earliest leaves as much room as possible for subsequent activities. This 'earliest finish time' greedy choice always leads to an optimal set of non-overlapping activities.