Hardness of Interval Scheduling on Unrelated Machines

06/26/2022
by   Danny Hermelin, et al.
0

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 lean manufacturing, where the goal is to complete jobs exactly at their deadline. We are given n jobs and m machines. Each job has a deadline, a weight, and a processing time that may be different on each machine. The goal is find a schedule that maximized the total weight of jobs completed exactly at their deadline. Note that this uniquely defines a processing time interval for each job on each machine. Interval Scheduling on Unrelated Machines is closely related to coloring interval graphs and has been thoroughly studied for several decades. However, as pointed out by Mnich and van Bevern [Computers & Operations Research, 2018], the parameterized complexity for the number m of machines as a parameter remained open. We resolve this by showing that Interval Scheduling on Unrelated Machines is W[1]-hard when parameterized by the number m of machines. To this end, we prove W[1]-hardness with respect to m of the special case where we have parallel machines with eligible machine sets for jobs. This answers Open Problem 8 of Mnich and van Bevern's list of 15 open problems in the parameterized complexity of scheduling [Computers & Operations Research, 2018]. Furthermore, we resolve the computational complexity status of the unweighted version of Interval Scheduling on Unrelated Machines by proving that it is NP-complete. This answers an open question by Sung and Vlach [Journal of Scheduling, 2005].

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/08/2019

Inapproximability Results for Scheduling with Interval and Resource Restrictions

In the restricted assignment problem, the input consists of a set of mac...
research
04/30/2021

On the Hardness of Scheduling With Non-Uniform Communication Delays

In the scheduling with non-uniform communication delay problem, the inpu...
research
02/26/2021

A Multivariate Complexity Analysis of the Material Consumption Scheduling Problem

The NP-hard MATERIAL CONSUMPTION SCHEDULING Problem and closely related ...
research
11/11/2018

Time-interval balancing in multi-processor scheduling of composite modular jobs (preliminary description)

The article describes a special time-interval balancing in multi-process...
research
07/17/2020

Parameterized Complexity of Scheduling Chains of Jobs with Delays

In this paper, we consider the parameterized complexity of the following...
research
05/31/2021

Parameterized Problems Complete for Nondeterministic FPT time and Logarithmic Space

Let XNLP be the class of parameterized problems such that an instance of...
research
07/16/2021

On the complexity of open shop scheduling with time lags

The minimization of makespan in open shop with time lags has been shown ...

Please sign up or login with your details

Forgot password? Click here to reset