20.1. Introduction

Try these first

1. 1.

   Define lateness in the context of scheduling.

   Hint

   Think about the relationship between job finish times and deadlines.

2. 2.

   What is a Greedy Algorithm?

   Hint

   Focus on how choices are made one at a time.

3. 3.

   What does the schedule aim to minimize?

   • Makespan
   • Lateness
   • Idle Time

   Hint

   Focus on the primary goal of the scheduling process.

4. 4.

   True or False: Greedy algorithms guarantee the best solution for all optimization problems.

   • True
   • False

   Hint

   Think about the limitations of greedy strategies.

5. 5.

   Given a list of jobs with their respective processing times and deadlines, construct a schedule and calculate the maximum lateness. Explain each choice in your schedule.

   Hint

   Focus on how each job's timing aligns with deadlines.

6. 6.

   Create a situation with three jobs that can be optimized by removing inversions in the order of scheduling. Show the initial and adjusted schedules.

   Hint

   Reflect on what an inversion looks like in your job order.