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.
Type de document :
Article dans une revue
RAIRO - Operations Research, EDP Sciences, 2016, 50, pp.781 - 795. <10.1051/ro/2016034>
Liste complète des métadonnées


https://hal-univ-bourgogne.archives-ouvertes.fr/hal-01533981
Contributeur : Benoît Darties <>
Soumis le : mardi 6 juin 2017 - 22:58:10
Dernière modification le : mercredi 5 juillet 2017 - 12:26:05

Fichiers

RAIRO-DGKS2016.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

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>

Partager

Métriques

Consultations de
la notice

73

Téléchargements du document

24