Bounds and approximation results for scheduling coupled-tasks with compatibility constraints
Computational Complexity
2017-06-08 v1 Data Structures and Algorithms
Abstract
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 (, ). 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.
Cite
@article{arxiv.1706.02200,
title = {Bounds and approximation results for scheduling coupled-tasks with compatibility constraints},
author = {Rodolphe Giroudeau and Jean-Claude König and Benoit Darties and Gilles Simonin},
journal= {arXiv preprint arXiv:1706.02200},
year = {2017}
}