Bounds and approximation results for scheduling coupled-tasks with compatibility constraints

This article is devoted to propose some lower and upper bounds for the coupled-tasks scheduling problem in presence of compatibility constraints according to classical complexity hypothesis ($\mathcal{P} \neq \mathcal{NP}$, $\mathcal{ETH}$). Moreover, we develop an efficient polynomial-time approximation algorithm for the specific case for which the topology describing the compatibility constraints is a quasi split-graph.

[1]  Gilles Simonin,et al.  Approximating a coupled-task scheduling problem in the presence of compatibility graph and additional tasks , 2013 .

[2]  Chris N. Potts,et al.  Scheduling of coupled tasks with unit processing times , 2010, J. Sched..

[3]  Lin Chen,et al.  On the optimality of approximation schemes for the classical scheduling problem , 2014, SODA.

[4]  Michal Pilipczuk.  Lower Bounds Based on the Exponential Time Hypothesis: Edge Clique Cover , 2016, Encyclopedia of Algorithms.

[5]  Miroslav Chlebík,et al.  Inapproximability Results for Bounded Variants of Optimization Problems , 2003, FCT.

[6]  Jean-Claude König,et al.  Theoretical aspects of scheduling coupled-tasks in the presence of compatibility graph , 2012, Algorithmic Oper. Res..

[7]  Dániel Marx,et al.  Lower bounds based on the Exponential Time Hypothesis , 2011, Bull. EATCS.

[8]  Russell Impagliazzo,et al.  Which problems have strongly exponential complexity? , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[9]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[10]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[11]  Hans L. Bodlaender,et al.  Partition Into Triangles on Bounded Degree Graphs , 2012, Theory of Computing Systems.

[12]  Gerhard J. Woeginger,et al.  Exact Algorithms for NP-Hard Problems: A Survey , 2001, Combinatorial Optimization.

[13]  Jean-Claude König,et al.  Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor , 2009, J. Sched..

[14]  Russell Impagliazzo,et al.  Complexity of k-SAT , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).

[15]  Michal Tanas,et al.  Scheduling of coupled tasks , 2004 .