Outline:

1. Recap of lesson 1
   
2. Evaluating scheduling algorthms
   
3. Earliest Due Date (EDD)
   
   • Problem statement
     
   • Algorithm
     
   • Proof of optimality
     
   • Guarantee test
     
   • More about optimality
     
4. Classifications of scheduling algorithms
5. Assignments: W1 and P1

Reading assignment (to be completed by the next class):

• Buttazzo section 2.3 (pp. 34-42)
• Buttazzo sections 3.1-3.2 (pp. 53-58)