Some complexity and approximation results for coupled-tasks scheduling problem according to topology

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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [18 references]  Display  Hide  Download

https://hal-univ-bourgogne.archives-ouvertes.fr/hal-01533981
Contributor : Benoît Darties <>
Submitted on : Tuesday, June 6, 2017 - 10:58:10 PM
Last modification on : Monday, February 11, 2019 - 11:50:15 AM
Long-term archiving on : Thursday, September 7, 2017 - 2:22:14 PM

Files

RAIRO-DGKS2016.pdf
Files produced by the author(s)

Identifiers

Citation

Benoit Darties, Rodolphe Giroudeau, Jean-Claude König, Gilles Simonin. Some complexity and approximation results for coupled-tasks scheduling problem according to topology. RAIRO - Operations Research, EDP Sciences, 2016, 50, pp.781-795. ⟨10.1051/ro/2016034⟩. ⟨hal-01533981⟩

Share

Metrics

Record views

332

Files downloads

236