Foundations of Scheduling Theory

Define scheduling problems using standard notation (α|β|γ classification).

Describe the role of release dates, due dates, and deadlines in scheduling.

Distinguish between common scheduling objectives (makespan, total completion time, tardiness, lateness).

Explain the difference between preemptive and non-preemptive scheduling.

Identify the computational complexity classes (P, NP, NP-hard) relevant to scheduling.