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.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [13 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00981164
Contributor : Benoît Darties <>
Submitted on : Thursday, June 12, 2014 - 3:46:52 PM
Last modification on : Monday, February 11, 2019 - 11:50:15 AM
Document(s) archivé(s) le : Friday, September 12, 2014 - 10:37:42 AM

File

ISCO2014-final.pdf
Files produced by the author(s)

Identifiers

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〉

Share

Metrics

Record views

327

Files downloads

227