Parameterized Complexity of Scheduling Chains of Jobs with Delays

07/17/2020
by   Hans L. Bodlaender, et al.
0

In this paper, we consider the parameterized complexity of the following scheduling problem. We must schedule a number of jobs on m machines, where each job has unit length, and the graph of precedence constraints consists of a set of chains. Each precedence constraint is labelled with an integer that denotes the exact (or minimum) delay between the jobs. We study different cases; delays can be given in unary and in binary, and the case that we have a single machine is discussed separately. We consider the complexity of this problem parameterized by the number of chains, and by the thickness of the instance, which is the maximum number of chains whose intervals between release date and deadline overlap. We show that this scheduling problem with exact delays in unary is W[t]-hard for all t, when parameterized by the thickness, even when we have a single machine (m = 1). When parameterized by the number of chains, this problem is W[1]-complete when we have a single or a constant number of machines, and W[2]-complete when the number of machines is a variable. The problem with minimum delays, given in unary, parameterized by the number of chains (and as a simple corollary, also when parameterized by the thickness) is W[1]-hard for a single or a constant number of machines, and W[2]-hard when the number of machines is variable. With a dynamic programming algorithm, one can show membership in XP for exact and minimum delays in unary, for any number of machines, when parameterized by thickness or number of chains. For a single machine, with exact delays in binary, parameterized by the number of chains, membership in XP can be shown with branching and solving a system of difference constraints. For all other cases for delays in binary, membership in XP is open.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/04/2022

Makespan Scheduling of Unit Jobs with Precedence Constraints in O(1.995^n) time

In a classical scheduling problem, we are given a set of n jobs of unit ...
research
07/26/2022

Approximation Algorithms for Scheduling under Non-Uniform Machine-Dependent Delays

We consider the problem of scheduling precedence-constrained jobs on het...
research
06/26/2022

Hardness of Interval Scheduling on Unrelated Machines

We provide new (parameterized) computational hardness results for Interv...
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
11/27/2019

Single Machine Batch Scheduling to Minimize the Weighted Number of Tardy Jobs

The 1|B,r_j|∑ w_jU_j scheduling problem takes as input a batch setup tim...
research
07/24/2021

Fair Allocation with Interval Scheduling Constraints

We study a fair resource scheduling problem, where a set of interval job...
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...

Please sign up or login with your details

Forgot password? Click here to reset