Scheduling stretched coupled-tasks with compatibilities constraints : model, complexity and approximation results for some class of graphs

Abstract : We tackle the makespan minimization coupled-tasks problem in presence of compatibility constraints. In particular, we focus on stretched coupled-tasks, {\it i.e.}coupled-tasks having the same sub-tasks execution time and idle time duration. We study severals problems in frame works of classic complexity and approximation for which the compatibility graph $G_c$ is bipartite (star, chain, $\ldots$) In such context, we design some efficient polynomial-time approximation algorithms according to difference parameters of the scheduling problem. When $G_c$ is a $k$-stage bipartite graph, we propose, among other, a $\frac{7}{6}$-approximation algorithm when $k=1$, and a $\frac{13}{9}$-approximation algorithm when $k=2$.\\
Type de document :
Rapport
2014
Liste complète des métadonnées


https://hal.archives-ouvertes.fr/hal-00947519
Contributeur : Benoît Darties <>
Soumis le : dimanche 16 février 2014 - 19:24:18
Dernière modification le : vendredi 9 juin 2017 - 10:42:32
Document(s) archivé(s) le : vendredi 16 mai 2014 - 10:40:11

Fichier

IR_stretched_tasks.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00947519, version 1

Collections

Citation

Benoit Darties, Rodolphe Giroudeau, Jean-Claude König, Gilles Simonin. Scheduling stretched coupled-tasks with compatibilities constraints : model, complexity and approximation results for some class of graphs. 2014. <hal-00947519>

Partager

Métriques

Consultations de
la notice

199

Téléchargements du document

125