Skip to Main content Skip to Navigation
Theses

Impact de la contrainte d'incompatibilité sur la complexité et l'approximation des problèmes d'ordonnancement en présence de tâches-couplées

Gilles Simonin 1
1 APR - Algorithmes et Performance des Réseaux
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : The last couple of years have seen the advent of sub-marine machines like the sub-marine torpedo. This torpedo execute two kind of tasks: acquisition tasks and treatment tasks. The acquisition tasks are equivalent to coupled-tasks, and treatment tasks are equivalent to classical tasks with preemption allowed. The torpedo possess several captors in order to realize the acquisitions, few captors cannot be used in same time because of the interferences. In this way, we introduce a compatibility graph in order to represent the acquisition tasks which can be executed in the same time. The torpedo possess a mono-processor used to execute the different tasks. In the first part, we introduce the model of the problem, and define the different tasks and their constraints. We discuss on the impact of the compatibility constraint on the general problem. Lastly, we finish this part with a related works on general scheduling theory, on coupled-tasks, and on the different cover problems in the graph theory. In a second part, we give the classification of the different problems according to the parameters of the coupled-tasks. We give several proofs of complexity for specific problem which are at the limit between polynomiality and completeness. For each studied problem, we propose either a optimal solution with an algorithm in polynomial time, or an approximation algorithm with guarantee of performance. For few problems, we study the complexity in details according to specific parameters or different topologies for the compatibility graph. All the long of this part, we try to show the impact of the introduction of the compatibility constraint on the scheduling problem with coupled-tasks.
Complete list of metadatas

https://tel.archives-ouvertes.fr/tel-00514928
Contributor : Gilles Simonin <>
Submitted on : Friday, September 3, 2010 - 5:48:35 PM
Last modification on : Friday, May 17, 2019 - 4:27:19 PM
Long-term archiving on: : Saturday, December 4, 2010 - 2:55:09 AM

Identifiers

  • HAL Id : tel-00514928, version 1

Citation

Gilles Simonin. Impact de la contrainte d'incompatibilité sur la complexité et l'approximation des problèmes d'ordonnancement en présence de tâches-couplées. Autre [cs.OH]. Université Montpellier II - Sciences et Techniques du Languedoc, 2009. Français. ⟨tel-00514928⟩

Share

Metrics

Record views

422

Files downloads

378