 |
HAL-LIRMM - Open Archive |  |
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.
Cited literature [22 references]
https://hal-lirmm.ccsd.cnrs.fr/lirmm-00355050
Contributor : Gilles Simonin <>
Submitted on : Wednesday, January 21, 2009 - 5:36:14 PM
Last modification on : Friday, October 25, 2019 - 1:22:33 AM
Document(s) archivé(s) le : Tuesday, June 8, 2010 - 6:23:00 PM
Contributor : Gilles Simonin <>
Submitted on : Wednesday, January 21, 2009 - 5:36:14 PM
Last modification on : Friday, October 25, 2019 - 1:22:33 AM
Document(s) archivé(s) le : Tuesday, June 8, 2010 - 6:23:00 PM
File
rapport-SDGK.pdf
Files produced by the author(s)
