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…