Extended Matching Problem for a Coupled-Tasks Scheduling Problem - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2009

Extended Matching Problem for a Coupled-Tasks Scheduling Problem

Gilles Simonin
Rodolphe Giroudeau
Jean-Claude König


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.
Fichier principal
Vignette du fichier
2-recouvrementRR.pdf (199.32 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

lirmm-00375000 , version 1 (10-04-2009)


  • 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⟩
164 View
54 Download


Gmail Facebook X LinkedIn More