Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revision | |||
| courses:cs211:winter2018:journals:holmesr:section_4.2 [2018/02/27 04:05] – holmesr | courses:cs211:winter2018:journals:holmesr:section_4.2 [2018/02/27 04:07] (current) – holmesr | ||
|---|---|---|---|
| Line 1: | Line 1: | ||
| - | ====== Section 4.2 Scheduling to Minimize Lateness ====== | + | ====== Section 4.2 Scheduling to Minimize Lateness: an Exchange Argument |
| This problem gives a set of requests which all may begin at time s and must use the resource for a specific interval of time. The difference from the previous problem is that instead of a start and end time, these requests only come with a deadline before which they must be completed. These criteria allow us a few possible rules by which we may define the greedy algorithm. | This problem gives a set of requests which all may begin at time s and must use the resource for a specific interval of time. The difference from the previous problem is that instead of a start and end time, these requests only come with a deadline before which they must be completed. These criteria allow us a few possible rules by which we may define the greedy algorithm. | ||
