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

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

Categories

%d bloggers like this: