New algorithms for minimizing the weighted number of tardy jobs on a single machine

In this paper we study the classical single machine scheduling problem where the objective is to minimize the weighted number of tardy jobs. Our analysis focuses on the case where one or more of three natural parameters is either constant or is taken as a parameter in the sense of parameterized complexity. These three parameters are the number of different due dates, processing times, and weights in our set of input jobs. We show that the problem belongs to the class of fixed parameter tractable (FPT) problems when combining any two of these three parameters. We also show that the problem is polynomial-time solvable when either one of the latter two parameters are constant, complementing Karp's result who showed that the problem is NP-hard already for a single due date.

Automated summary

This paper studies the classical single machine scheduling problem aiming to minimize the weighted number of tardy jobs, analyzing the impact of different numbers of due dates, processing times, and weights on the complexity of the problem. The problem belongs to the class of fixed parameter tractable (FPT) problems when combining any two parameters, and it is solvable in polynomial time when either of the latter two parameters is constant.