Minimizing the number of tardy jobs with generalized due-dates and position-dependent processing times

Abstract We study a single machine scheduling problem with generalized due-dates and general position-dependent job processing times. The objective function is minimum number of tardy jobs. The problem is proved to be NP-hard in the strong sense. We introduce an efficient algorithm that solves medium size problems in reasonable running time. A simple and efficient heuristic is also introduced, which obtained the optimal solution in the vast majority of our tests.