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

Danny Hermelin, Shlomo Karhi, Michael Pinedo, Dvir Shabtay

Research output: Contribution to journalArticlepeer-review

12 Scopus citations


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.

Original languageEnglish
Pages (from-to)271-287
Number of pages17
JournalAnnals of Operations Research
Issue number1
StatePublished - Mar 2021

Bibliographical note

Publisher Copyright:
© 2018, Springer Science+Business Media, LLC, part of Springer Nature.


  • Fixed parametrized tractability
  • NP-hard
  • Polynomial time algorithms
  • Single machine scheduling
  • Weighted number of tardy jobs


Dive into the research topics of 'New algorithms for minimizing the weighted number of tardy jobs on a single machine'. Together they form a unique fingerprint.

Cite this