Scheduling coupled-tasks with incompatibility constraint: a bin-packing related problem
Résumé
We tackle the makespan minimization problem of coupled- tasks in presence of compatibility constraint. In particular, we focus on stretched coupled-tasks, i.e. coupled-tasks having the same sub-tasks execution time and idle time duration. We show the relationship with bin packing problems for some configurations, and study several problems in framework of complexity and approximation for which the topology of the compatibility graph is specific (star, chain, bipartite, . . .).
Domaines
Recherche opérationnelle [math.OC]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...