Posted by: atri | October 17, 2011

Lect 20: Scheduling to minimize lateness

In today’s lecture, we studied a scheduling problem where one has flexibility in when to schedule a job but one is interested in minimizing the maximum time by which a scheduling job overshot its deadline. Next lecture, we will start proving the correctness of the greedy algorithm we saw in class today. The material will be from Sec 4.2 in the textbook.

The slides have been uploaded.

Below are links to the student blog post(s) 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: