Single Machine Batch Scheduling to Minimize the Weighted Number of Tardy Jobs

Danny Hermelin, Matthias Mnich, Simon Omlor

The $1|B,r_j|\sum w_j{U}_j$ scheduling problem takes as input a batch setup time $\Delta$ and a set of $n$ jobs, each having a processing time, a release date, a weight, and a due date; t…