New algorithms for minimizing the weighted number of tardy jobs on a single machine
From MaRDI portal
Publication:829184
DOI10.1007/s10479-018-2852-9zbMath1467.90008arXiv1709.05751MaRDI QIDQ829184
Dvir Shabtay, Danny Hermelin, Shlomo Karhi, Michael L. Pinedo
Publication date: 5 May 2021
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1709.05751
NP-hard; single machine scheduling; polynomial time algorithms; weighted number of tardy jobs; fixed parametrized tractability
90B35: Deterministic scheduling theory in operations research