Activity selection problem
The activity selection problem is a combinatorial optimization problem concerning the 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. The activity selection problem is also known as the Interval scheduling maximization problem (ISMP), which is a special type of the more general Interval Scheduling problem.
Wikipage redirect
Link from a Wikipage to another Wikipage
primaryTopic
Activity selection problem
The activity selection problem is a combinatorial optimization problem concerning the 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. The activity selection problem is also known as the Interval scheduling maximization problem (ISMP), which is a special type of the more general Interval Scheduling problem.
has abstract
The activity selection problem ...... mework of operations research.
@en
Link from a Wikipage to an external page
Wikipage page ID
24,598,717
page length (characters) of wiki page
Wikipage revision ID
1,005,900,899
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
hypernym
type
comment
The activity selection problem ...... l Interval Scheduling problem.
@en
label
Activity selection problem
@en