The problem of minimizing the number of tardy jobs while also minimizing the maximum tardiness on a single machine is strongly NP-hard.