2 citations · 9 across the 18 of their papers we have counts for
5 papers · 1 filter
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…
Minimizing the Number of Tardy Jobs with Uniform Processing Times on Parallel Machines
Klaus Heeger, Hendrik Molter
In this work, we study the computational (parameterized) complexity of . Here, we are given identical parallel machines and jobs with…
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…
Fully Polynomial-time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication
Matthias Bentert, Klaus Heeger, Tomohiro Koana
We study the computational complexity of several polynomial-time-solvable graph problems parameterized by vertex integrity, a measure of a graph's vulnerability to vertex removal i…
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…