 |
 |
Communication dans un congrès
Theoretical Aspects of Scheduling Coupled-Tasks in the Presence of Compatibility Graph
Abstract : This paper presents a generalization of the coupled-task scheduling problem introduced by Shapiro, where considered tasks are subject to incompatibility constraint depicted by an undirected graph. The motivation of this problem comes from data acquisition and processing in a mono-processor torpedo used for underwater exploration. As we add the compatibility graph, we focus on complexity of the problem, and more precisely on the border between P and NP-completeness when some other input parameters are restricted (e.g. the ratio between the durations of the two sub-tasks composing a task): we adapt the global visualization of the complexity of scheduling problems with coupled-task given by Orman and Potts to our problem, determine new complexity results, and thus propose a new visualization including incompatibility constraint. In the end, we give a new polynomial-time approximation algorithm result which completes previous works.
Keywords :
scheduling
Complexity
Littérature citée [14 références]
https://hal-univ-bourgogne.archives-ouvertes.fr/hal-00612821
Contributeur : Benoît Darties <>
Soumis le : lundi 1 août 2011 - 01:42:44
Dernière modification le : lundi 30 mars 2020 - 08:48:36
Document(s) archivé(s) le : lundi 7 novembre 2011 - 12:22:35
Contributeur : Benoît Darties <>
Soumis le : lundi 1 août 2011 - 01:42:44
Dernière modification le : lundi 30 mars 2020 - 08:48:36
Document(s) archivé(s) le : lundi 7 novembre 2011 - 12:22:35
Fichier
2695-11294-1-PB-1.pdf
Fichiers éditeurs autorisés sur une archive ouverte
