Theoretical Aspects of Scheduling Coupled-Tasks in the Presence of Compatibility Graph

Rodolphe Giroudeau 1 Benoit Darties 2, 1 Jean-Claude König 1 Gilles Simonin 3, 1
1 MAORE - Méthodes Algorithmes pour l'Ordonnancement et les Réseaux
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
2 Le2i - Laboratoire Electronique, Informatique et Image [UMR6303]
3 LAAS - Laboratoire d'analyse et d'architecture des systèmes
Abstract : This paper presents a generalization of the coupled-task sche-duling problem introduced by Shapiro \cite{Shapiro}, where considered tasks are subject to incompatibility constraints 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 boundary between $\mathcal{P}$ and $\mathcal{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 \cite{op1997} to our model, determine new complexity results, and thus propose a new visualization including incompatibility constraints. In the end, we give a new polynomial-time approximation algorithm result which completes previous works.
Keywords : coupled-tasks scheduling approximation algorithm complexity
Document type :
Journal articles
Complete list of metadatas
https://hal-lirmm.ccsd.cnrs.fr/lirmm-00715828
Contributor : Rodolphe Giroudeau <>
Submitted on : Monday, July 9, 2012 - 12:45:44 PM
Last modification on : Saturday, October 26, 2019 - 1:29:59 AM

Identifiers

  • HAL Id : lirmm-00715828, version 1

Collections

UNIV-BOURGOGNE | LE2I | MAORE | LIRMM | INSA-TOULOUSE | MIPS | UNIV-MONTPELLIER | LAAS | ICB | UNIV-HESAM | INSA-GROUPE | UNIV-TLSE3 | UT1-CAPITOLE | UNIV-TLSE2

Citation

Rodolphe Giroudeau, Benoit Darties, Jean-Claude König, Gilles Simonin. Theoretical Aspects of Scheduling Coupled-Tasks in the Presence of Compatibility Graph. Algorithmic Operations Research, Preeminent Academic Facets, 2012, 7 (1), pp.1-12. ⟨lirmm-00715828⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

319

Contact

CCSD