Activity Selection Problem
Calculator for calculating the Activity Selection Problem
This function calculates the Activity Selection Problem
The activity selection problem is an optimization problem used to find the maximum number of activities a person can perform if they can only work on one activity at a time. This problem is also known as the interval scheduling maximization problem (ISMP).
Input format
The data can be entered as a series of numbers, separated by semicolons or spaces. It is recommended to enter the data as a list (one value per line).
|
The graphic above shows that activities a1, a2, a4 and a5 can be carried out by one person since there is no overlap in time.
|
|