Coupled-Tasks in Presence of Bipartite Compatibilities Graphs: Third International Symposium, ISCO 2014, Lisbon, Portugal, March 5-7, 2014, Revised Selected Papers

Abstract : We tackle the makespan minimization coupled-tasks prob- lem in presence of incompatibility constraints. 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 the framework of classic complexity and approximation for which the compatibility graph is bipartite (star, chain, ...). In such context, we design efficient polynomial-time approximation algorithms according to different parameters of the scheduling problem.
Type de document :
Communication dans un congrès
ISCO: International Symposium on Combinatorial Optimization, 2014, Lisbon, Portugal. Springer, 13rd International Symposium on Combinatorial Optimization, LNCS (8596), pp.161-172, 2014, Combinatorial Optimization. 〈10.1007/978-3-319-09174-7_14〉
Liste complète des métadonnées

Littérature citée [13 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-00981164
Contributeur : Benoît Darties <>
Soumis le : jeudi 12 juin 2014 - 15:46:52
Dernière modification le : mardi 10 octobre 2017 - 13:50:26
Document(s) archivé(s) le : vendredi 12 septembre 2014 - 10:37:42

Fichier

ISCO2014-final.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Benoit Darties, Gilles Simonin, Rodolphe Giroudeau, Jean-Claude König. Coupled-Tasks in Presence of Bipartite Compatibilities Graphs: Third International Symposium, ISCO 2014, Lisbon, Portugal, March 5-7, 2014, Revised Selected Papers. ISCO: International Symposium on Combinatorial Optimization, 2014, Lisbon, Portugal. Springer, 13rd International Symposium on Combinatorial Optimization, LNCS (8596), pp.161-172, 2014, Combinatorial Optimization. 〈10.1007/978-3-319-09174-7_14〉. 〈hal-00981164〉

Partager

Métriques

Consultations de
la notice

169

Téléchargements du document

129