Hendrik Molter

collaborators

3 papers

cs.DS2024

Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates

Matthias Kaul, Matthias Mnich, Hendrik Molter

We study the fundamental scheduling problem $1 ∣ r_{j} ∣ \sum w_{j} U_{j}$ : schedule a set of $n$ jobs with weights, processing times, release dates, and due dates on a single machine…

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

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 $P ∣ r_{j}, p_{j} = p ∣ \sum_{j} w_{j} U_{j}$ . Here, we are given $m$ identical parallel machines and $n$ jobs with…