(Latest Revision: Feb 27, 2020)

Problem on Interval Scheduling and Interval Partitioning

An Example Problem

We begin with a list of intervals: 
13  15
17  22
12  17
 9  10
12  15
 9  11
11  14
10  15
16  19
12  14
18  23
 8  11
Here is the same list of intervals (stably) sorted by increasing finish time: 
 9  10
 9  11
 8  11
11  14
12  14
13  15
12  15
10  15
12  17
16  19
17  22
18  23
Here is the list with letters next to the intervals chosen by the "Scheduling Intervals" algorithm: 
 9  10   A
 9  11  
 8  11
11  14   B
12  14
13  15
12  15
10  15
12  17
16  19   C
17  22
18  23
Here is the same list of intervals (stably) sorted by increasing start time: 
 8  11
 9  10
 9  11
10  15
11  14
12  17
12  15
12  14
13  15
16  19
17  22
18  23
Solution Chosen by the Interval Partitioning Algorithm: 
Classroom A:  8  11, 11  14, 16  19
Classroom B:  9  10, 10  15, 18  23
Classroom C:  9  11, 12  17
Classroom D:  12  15
Classroom E:  12  14, 17  22
Classroom F:  13  15
The Assignment

Using the input below, work the same kind of problem as the example above illustrates. 
 8 11
13 15
 9 10
 8 10
15 16
16 19
18 19
 8 10
 9 14
11 16
17 19
 9 13