e/Activity selection problem

Information
has gloss	eng: The activity selection problem deals with selection of non-conflicting activities to perform within a given time frame, given a set of activities each marked by a start time (si) and finish time (fi). The problem is to select the maximum number of activities that can be performed by a single person or machine, assuming that a person can only work on a single activity at a time.
lexicalization	eng: Activity selection problem
instance of	e/Scheduling algorithm