Some complexity and approximation results for coupled-tasks scheduling problem according to topology - Université de Bourgogne Accéder directement au contenu
Article Dans Une Revue RAIRO - Operations Research Année : 2016

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

Résumé

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.
Fichier principal
Vignette du fichier
RAIRO-DGKS2016.pdf (237.89 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01533981 , version 1 (06-06-2017)

Identifiants

Citer

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, 2016, 50, pp.781-795. ⟨10.1051/ro/2016034⟩. ⟨hal-01533981⟩
319 Consultations
441 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More