Interval scheduling

Interval scheduling is a class of problems in computer science, particularly in the area of algorithm design. A list of tasks is given as a set of time intervals; for instance, one task might run from 2:00 to 5:00 and another task might run from 6:00 to 8:00. When none of the intervals overlap the optimum solution is trivial. However, when multiple tasks are overlapping, the problem gets more difficult. One typical

See also

• Scheduling (computing)
• Earliest deadline first scheduling

Sources

• Kleinberg, Jon (2006). Algorithm Design. ISBN 0321295358. {{cite book}}: Unknown parameter |coauthors= ignored (|author= suggested) (help)