2 citations · 2 across the 9 of their papers we have counts for
10 papers
Approximate Total Weighted Completion Time with Convex Controllable Processing Times
Klaus Heeger, Danny Hermelin, Dvir Shabtay
We study the single-machine scheduling problem with controllable processing times to minimize the total weighted completion time, focusing on the setting where a job's processing t…
Lawler-Moore Speedups via Additive Combinatorics
Karl Bringmann, Danny Hermelin, Tomohiro Koana +1
The Lawler-Moore dynamic programming framework is a classical tool in scheduling on parallel machines. It applies when the objective is regular, i.e. monotone in job completion tim…
Fast Makespan Minimization via Short ILPs
Danny Hermelin, Dvir Shabtay
Short integer linear programs are programs with a relatively small number of constraints. We show how recent improvements on the running-times of solvers for such programs can be u…
Robust Permutation Flowshops Under Budgeted Uncertainty
Noam Goldberg, Danny Hermelin, Dvir Shabtay
We consider the robust permutation flowshop problem under the budgeted uncertainty model, where at most a given number of job processing times may deviate on each machine. We show…
Approximation Algorithms for Fair Repetitive Scheduling
Danny Hermelin, Danny Segev, Dvir Shabtay
We consider a recently introduced fair repetitive scheduling problem involving a set of clients, each asking for their associated job to be daily scheduled on a single machine acro…
Concurrency Constrained Scheduling with Tree-Like Constraints
Hans L. Bodlaender, Danny Hermelin, Erik Jan van Leeuwen
This paper investigates concurrency-constrained scheduling problems, where the objective is to construct a schedule for a set of jobs subject to concurrency restrictions. Formally,…
Faster Minimization of Total Weighted Completion Time on Parallel Machines
Danny Hermelin, Tomohiro Koana, Dvir Shabtay
We study the classical problem of minimizing the total weighted completion time on a fixed set of identical machines working in parallel, the problem in the s…
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 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…
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…