AI engineering glossary · Data structures algorithms
What is interval scheduling?
Interval scheduling: The problem of choosing the largest set of time intervals that do not overlap. A greedy rule of always picking the interval that ends earliest is provably optimal. This is a standard example of a greedy algorithm.
Interval scheduling: an example
From meetings 9-11, 10-12 and 11-13, choosing the one ending earliest (9-11) then 11-13 allows two meetings instead of one.
Related terms
More Data structures algorithms terms
- Kadane's algorithm
- Knapsack problem
- Knuth-Morris-Pratt algorithm
- Kruskal's algorithm
- Linear search
- Linked list
- Load factor
- Longest common subsequence
Where you learn it
Interval scheduling is part of the AI Engineering Program, which teaches it with notes, a hands-on lab and an exam. The first lesson is free.