Complexity and Approximation for Scheduling Problem for Coupled-Tasks in Presence of Compatibility Tasks
Résumé
In this paper, we study a scheduling problem with compled-tasks in presence of incompatible constraint. We give complexity results and a polynomial-time approximation for a specific problem when the compatibility graph has different topologies.
Domaines
Recherche opérationnelle [math.OC]
Origine : Fichiers produits par l'(les) auteur(s)
Loading...