Coupled-Tasks in Presence of Bipartite Compatibilities Graphs

Benoit Darties (1) , Gilles Simonin (2) , Rodolphe Giroudeau (3) , Jean-Claude König (3)

1 Le2i - Laboratoire Electronique, Informatique et Image [UMR6306]
2 Insight Centre for Data Analytics [Dublin]
3 MAORE - Methods, Algorithms for Operations REsearch

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.

Domaines: Recherche opérationnelle [math.OC]

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⟩