Skip to Main content Skip to Navigation
Conference papers

Coupled-Tasks in Presence of Bipartite Compatibilities Graphs

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
Complete list of metadata

Cited literature [13 references]  Display  Hide  Download
Contributor : Benoît Darties <>
Submitted on : Thursday, June 12, 2014 - 3:46:52 PM
Last modification on : Friday, July 17, 2020 - 2:54:05 PM
Long-term archiving on: : Friday, September 12, 2014 - 10:37:42 AM


Files produced by the author(s)



Benoit Darties, Gilles Simonin, Rodolphe Giroudeau, Jean-Claude König. Coupled-Tasks in Presence of Bipartite Compatibilities Graphs. ISCO: International Symposium on Combinatorial Optimization, Mar 2014, Lisbon, Portugal. pp.161-172, ⟨10.1007/978-3-319-09174-7_14⟩. ⟨hal-00981164⟩



Record views


Files downloads