{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

CSE331 Lecture 21 - Party Term paper Term paper Party Party...

Info icon This preview shows pages 1–8. Sign up to view the full content.

View Full Document Right Arrow Icon
Lecture 21 CSE 331 Oct 19, 2011
Image of page 1

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Technical Interviews (Sean) - Thursday October 27 th - 6:30 – 9:00 PM - Faculty comments - Free Stuff!!! - Sign-Ups
Image of page 2
Online office hrs tonight 10:00pm
Image of page 3

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Scheduling to minimize lateness n jobs: i th job ( t i ,d i ) Schedule the n jobs: i th job gets interval [ s(i),f(i)=s(i)+t i ) At most one job at any time At most one job at any time Algo picks s(i) Algo picks s(i) GOAL: Minimize MAXIMUM lateness Lateness of job i , l i = max (0,f(i)-d i ) Not the sum Not the sum start time: s
Image of page 4
The Greedy Algorithm (Assume jobs sorted by deadline: d 1 ≤ d 2 ≤ ….. ≤ d n ) f=s For every i in 1..n do Schedule job i from s(i)=f to f(i)=f+t i f=f+t i
Image of page 5

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Solving end of Semester blues Monday Tuesday Wednesday Thursday Friday Project Project 331 HW 331 HW Exam study Exam study
Image of page 6
Image of page 7

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Image of page 8
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Party! Term paper Term paper Party! Party! Exam study Exam study 331 HW 331 HW P r P r Term paper Term paper 2 Max lateness = 2 Max lateness = 2 Today’s agenda Prove that the greedy schedule output minimizes the maximum lateness Two definitions for schedules f=s For every i in 1..n do Schedule job i from s(i)=f to f(i)=f+t i f=f+t i Idle time Inversion Max “gap” between two consecutively scheduled tasks i i j j Idle time =1 Idle time =0 (i,j) is an inversion if i is scheduled before j but d i > d j i i j j i i j j What is the idle time and max # inversion for greedy schedule? What is the idle time and max # inversion for greedy schedule?...
View Full Document

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern