1 citations · 1 across the 3 of their papers we have counts for
5 papers
Scheduling Lower Bounds via AND Subset Sum
Amir Abboud, Karl Bringmann, Danny Hermelin +1
Given instances of Subset Sum, the AND Subset Sum problem asks to determine whether all of these instances are yes-instances; that is, whether each…
Faster Minimization of Tardy Processing Time on a Single Machine
Karl Bringmann, Nick Fischer, Danny Hermelin +2
This paper is concerned with the problem, the problem of minimizing the total processing time of tardy jobs on a single machine. This is not only a fundamental sch…
New Algorithms for Minimizing the Weighted Number of Tardy Jobs On a Single Machine
Danny Hermelin, Shlomo Karhi, Mike Pinedo +1
In this paper we study the classical single machine scheduling problem where the objective is to minimize the total weight of tardy jobs. Our analysis focuses on the case where one…
On The Parameterized Tractability of the Just-In-Time Flow-Shop Scheduling Problem
Danny Hermelin, Dvir Shabtay, Nimrod Talmon
Since its development in the early 90's, parameterized complexity has been widely used to analyze the tractability of many NP-hard combinatorial optimization problems with respect…
Scheduling Two Agents on a Single Machine: A Parameterized Analysis of NP-hard Problems
Danny Hermelin, Judith-Madeleine Kubitza, Dvir Shabtay +2
Scheduling theory is an old and well-established area in combinatorial optimization, whereas the much younger area of parameterized complexity has only recently gained the attentio…