2 citations · 2 across the 9 of their papers we have counts for
Showing 2024Show all
3 papers · 1 filter
cs.DS2024
Fair Repetitive Interval Scheduling
Klaus Heeger, Danny Hermelin, Yuval Itzhaki +2
Fair resource allocation is undoubtedly a crucial factor in customer satisfaction in several scheduling scenarios. This is especially apparent in repetitive scheduling models where…
cs.DS2024★ 2 cited
Minimizing the Number of Tardy Jobs and Maximal Tardiness on a Single Machine is NP-hard
Klaus Heeger, Danny Hermelin, Michael L. Pinedo +1
This paper resolves a long-standing open question in bicriteria scheduling regarding the complexity of a single machine scheduling problem which combines the number of tardy jobs a…
cs.DS2024
Minimizing the Weighted Number of Tardy Jobs is W[1]-hard
Klaus Heeger, Danny Hermelin
We consider the problem, the problem of minimizing the weighted number of tardy jobs on a single machine. This problem is one of the most basic and fundamental pr…