//-->
Revisit the scheduling problem with assignable or generalized due dates to minimize total weighted late work
Chen, Rubing, (2023)
The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs
Chen, Rubing, (2019)
Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines