Skip to Main content Skip to Navigation
Conference papers

Extended Matching Problem for a Coupled-Tasks Scheduling Problem

Gilles Simonin 1 Rodolphe Giroudeau 1 Jean-Claude König 1 
1 APR - Algorithmes et Performance des Réseaux
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : This paper introduces a scheduling problem with coupled-tasks in presence of a compatibility graph on a single processor. We investigate a specific configuration, in which the coupled-tasks possess an idle time equal to 2. The complexity of these problems will be studied according to the presence or absence of triangles in the compatibility graph. As an extended matching, we propose a polynomial-time algorithm which consists in minimizing the number of non-covered vertices, by covering vertices with edges or paths of length two in the compatibility graph. This type of covering will be denoted by 2-cover technique. According on the compatibility graph type, the 2-cover technique provides a polynomial-time rho-approximation algorithm with rho=13/12 (resp. rho=10/9) in absence (resp. presence) of triangles.
Complete list of metadata

Cited literature [10 references]  Display  Hide  Download
Contributor : Gilles Simonin Connect in order to contact the contributor
Submitted on : Friday, April 10, 2009 - 5:35:34 PM
Last modification on : Friday, August 5, 2022 - 10:45:47 AM
Long-term archiving on: : Thursday, June 10, 2010 - 8:20:54 PM


Files produced by the author(s)


  • HAL Id : lirmm-00375000, version 1



Gilles Simonin, Rodolphe Giroudeau, Jean-Claude König. Extended Matching Problem for a Coupled-Tasks Scheduling Problem. TMFCS'09: International Conference on Theoretical and Mathematical Foundations of Computer Science, Jul 2009, Orlando, Florida, United States. pp.082-089. ⟨lirmm-00375000⟩



Record views


Files downloads