Posted by: atri | October 25, 2010

## Lect 23: Scheduling to minimize lateness

In today’s lecture, we first saw how to implement the greedy algorithm for the interval scheduling problem in $O(n\log{n})$ time. We then looked at a new scheduling problem, where the goal is minimize the worst-case “lateness” of scheduled jobs. The slides have been uploaded.

Next lecture, we will formally state the greedy algorithm for the new scheduling problem and then proceed to analyze its correctness. This material will be from Sec 4.2 in the book.

Here are links to the student posts for the lecture