Single-Machine Scheduling to Minimize the Number of Tardy Jobs with
Release Dates
Single-Machine Scheduling to Minimize the Number of Tardy Jobs with
Release Dates
We study the fundamental scheduling problem $1\mid r_j\mid\sum w_j U_j$: schedule a set of $n$ jobs with weights, processing times, release dates, and due dates on a single machine, such that each job starts after its release date and we maximize the weighted number of jobs that complete execution before …