Class Notes (839,561)
CSCA67H3 (56)
Lecture

# Week 1 - Scheduling.docx

2 Pages
331 Views

Department
Computer Science
Course Code
CSCA67H3
Professor
Anna Bretscher

This preview shows 80% of the first page. Sign up to view the full 2 pages of the document.
Description
Interval Scheduling Problem Aim: Schedule the jobs so that the number of jobs scheduled is maximized and jobs do not overlap Notation: J: The set of jobs th i: The i job s: The start time of the i job i th fi The finish time of the i job Algorithm: Ordering: Sort the jobs by increasing finish time. 3 ,6j 1 j7, j4, 2 ,5j , j Scheduling: Schedule each job if there are no conflicts. j3, 7 ,5j Proof if the algorithm is best - Proof by Contradiction: Idea: Play Devil’s Advocate Assume our solution is not the best. This means there is a better solution B Show that our algorithm’s solution is as good as B by making B equivalent
More Less

Only 80% of the first page are available for preview. Some parts have been intentionally blurred.

Unlock Document

Unlock to view full version

Unlock Document
Me

OR

Join OneClass

Access over 10 million pages of study
documents for 1.3 million courses.

Join to view

OR

By registering, I agree to the Terms and Privacy Policies
Just a few more details

So we can recommend you notes for your school.