Isomorphic Coupled-Task Scheduling Problem with Compatibility Constraints on a Single Processor - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2009

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 its two sub-tasks. We prove NP-completeness of the minimization of the schedule length, and 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 (3a+2b)/(2a+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 3/2 and 5/4. Using a polynomial-time algorithm developed for some class of graph of min-DCP, we show that the ratio decreases to (1+\sqrt{3})/2.
Fichier principal
Vignette du fichier
rapport-SDGK.pdf (200.66 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

lirmm-00355050 , version 1 (21-01-2009)

Identifiers

  • HAL Id : lirmm-00355050 , version 1

Cite

Gilles Simonin, Benoit Darties, Rodolphe Giroudeau, Jean-Claude König. Isomorphic Coupled-Task Scheduling Problem with Compatibility Constraints on a Single Processor. MISTA'2009: 4th Multidisciplinary International Scheduling Conference: Theory and Applications, Aug 2009, Dublin, Ireland. pp.378-388. ⟨lirmm-00355050⟩
292 View
268 Download

Share

Gmail Facebook X LinkedIn More