lecture_08a - Interval Scheduling Interval scheduling Job j...

Info iconThis preview shows pages 1–13. Sign up to view the full content.

View Full Document Right Arrow Icon
Interval Scheduling Interval scheduling. s Job j starts at s j and finishes at f j . s Two jobs are compatible if they don't overlap. s Goal : find the largest subset of mutually compatible jobs. 1 TIME
Background image of page 1

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

View Full DocumentRight Arrow Icon
Interval Scheduling: Greedy Algorithms Greedy template . s Sort the jobs in some order, start time. s Consider the job one by one; accept a job if it's compatible with the ones already accepted . 2
Background image of page 2
Example: earliest finish time A C B D E Time 0 F G 1 2 3 4 5 6 7 8 9 10 11 H 0 1 2 3 4 5 6 7 8 9 10 11
Background image of page 3

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

View Full DocumentRight Arrow Icon
A C B D E 0 1 2 3 4 5 6 7 8 9 10 11 B Time 0 F G 1 2 3 4 5 6 7 8 9 10 11 H
Background image of page 4
A C B D E 0 1 2 3 4 5 6 7 8 9 10 11 B C Time 0 F G 1 2 3 4 5 6 7 8 9 10 11 H
Background image of page 5

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

View Full DocumentRight Arrow Icon
A C B D E 0 1 2 3 4 5 6 7 8 9 10 11 B A Time 0 F G 1 2 3 4 5 6 7 8 9 10 11 H
Background image of page 6
A C B D E 0 1 2 3 4 5 6 7 8 9 10 11 B E Time 0 F G 1 2 3 4 5 6 7 8 9 10 11 H
Background image of page 7

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

View Full DocumentRight Arrow Icon
A C B D E 0 1 2 3 4 5 6 7 8 9 10 11 B E D Time 0 F G 1 2 3 4 5 6 7 8 9 10 11 H
Background image of page 8
A C B D E 0 1 2 3 4 5 6 7 8 9 10 11 B E F Time 0 F G 1 2 3 4 5 6 7 8 9 10 11 H
Background image of page 9

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

View Full DocumentRight Arrow Icon
A C B D E 0 1 2 3 4 5 6 7 8 9 10 11 B E G Time 0 F G 1 2 3 4 5 6 7 8 9 10 11 H
Background image of page 10
A C B D E 0 1 2 3 4 5 6 7 8 9 10 11 B E H Time 0 F G 1 2 3 4 5 6 7 8 9 10 11 H
Background image of page 11

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

View Full DocumentRight Arrow Icon
Interval Scheduling: Greedy Algorithms Greedy template . Sort the jobs in some order. Consider the job one by one; accept a job if it's compatible with the ones already accepted . s [Earliest start time] Consider jobs in ascending order f start time s 12 of start time s j . s [Earliest finish time] Consider jobs in ascending order of finish time f j . s
Background image of page 12
Image of page 13
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 03/01/2010 for the course CS 1234 taught by Professor Chan during the Spring '10 term at University of the Bío-Bío.

Page1 / 24

lecture_08a - Interval Scheduling Interval scheduling Job j...

This preview shows document pages 1 - 13. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online