Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor

Abstract : The problem presented in this paper is a generalization of the usual coupled-tasks scheduling problem in presence of compatibility constraints. The reason behind this study is the data acquisition problem for a submarine torpedo. We investigate a particular configuration for coupled tasks (any task is divided into two sub-tasks separated by an idle time), in which the idle time of a coupled task is equal to the sum of durations of its two sub-tasks. We prove -completeness of the minimization of the schedule length, we show that finding a solution to our problem amounts to solving a graph problem, which in itself is close to the minimum-disjoint-path cover (min-DCP) problem. We design a (2a+2b3a+2b)-approximation, where a and b (the processing time of the two sub-tasks) are two input data such as a>b>0, and that leads to a ratio between 23 and 45. Using a polynomial-time algorithm developed for some class of graph of min-DCP, we show that the ratio decreases to 21+3137 .
Type de document :
Article dans une revue
Journal of Scheduling, Springer Verlag, 2010, 14 (5), pp.501-509. <10.1007/s10951-010-0193-x>
Liste complète des métadonnées

https://hal-univ-bourgogne.archives-ouvertes.fr/hal-00612822
Contributeur : Benoit Darties <>
Soumis le : lundi 1 août 2011 - 02:00:44
Dernière modification le : jeudi 21 janvier 2016 - 01:01:13
Document(s) archivé(s) le : lundi 12 novembre 2012 - 14:45:56

Fichier

MISTA-JOS-2009.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Gilles Simonin, Benoit Darties, Rodolphe Giroudeau, Jean-Claude König. Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor. Journal of Scheduling, Springer Verlag, 2010, 14 (5), pp.501-509. <10.1007/s10951-010-0193-x>. <hal-00612822>

Partager

Métriques

Consultations de
la notice

276

Téléchargements du document

192