Selects the maximum number of mutually compatible activities by greedily picking each next activity with the earliest finish time.