Some complexity and approximation results for coupled-tasks scheduling problem according to topology
Computational Complexity
2017-06-08 v1 Data Structures and Algorithms
Abstract
We consider the makespan minimization coupled-tasks problem in presence of compatibility constraints with a specified topology. In particular, we focus on stretched coupled-tasks, i.e. coupled-tasks having the same sub-tasks execution time and idle time duration. We study several problems in framework of classic complexity and approximation for which the compatibility graph is bipartite (star, chain,. . .). In such a context, we design some efficient polynomial-time approximation algorithms for an intractable scheduling problem according to some parameters.
Keywords
Cite
@article{arxiv.1706.02214,
title = {Some complexity and approximation results for coupled-tasks scheduling problem according to topology},
author = {Benoit Darties and Rodolphe Giroudeau and Jean-Claude König and Gilles Simonin},
journal= {arXiv preprint arXiv:1706.02214},
year = {2017}
}