Description:
- Given a set of n jobs all of which must be scheduled on a single resource such that all jobs arrive at time and each job has a deadline and a length ,
- How to minimize the maximum lateness of the resulting schedule?
- total lateness,
Earliest deadline first algorithm:
- Sort all the jobs based on deadline
- for each job
- assign to interval
- calculate deadline
- Why is this complete and optimal?