13 citations · 59 across the 31 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.CC2022
Hardness of Interval Scheduling on Unrelated Machines
Danny Hermelin, Yuval Itzhaki, Hendrik Molter +1
We provide new (parameterized) computational hardness results for Interval Scheduling on Unrelated Machines. It is a classical scheduling problem motivated from just-in-time or lea…
cs.DS2022★ 1 cited
Minimizing the Weighted Number of Tardy Jobs via (max,+)-Convolutions
Danny Hermelin, Hendrik Molter, Dvir Shabtay
The problem asks to determine -- given jobs each with its own processing time, weight, and due date -- the minimum weighted number of tardy jobs in any s…