2-Cover Definition for a Coupled-Tasks Scheduling Problem - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Reports (Research Report) Year : 2009

2-Cover Definition for a Coupled-Tasks Scheduling Problem

Gilles Simonin
Rodolphe Giroudeau
Jean-Claude König


This paper presents a scheduling problem with coupled-tasks in presence of a compatibility graph on a mono 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 2-cover technique. According on the compatibility graph type, the 2-cover technique provides an 13/12-approximation or 10/9-approximation algorithm.
Fichier principal
Vignette du fichier
2-recouvrementRR.pdf (199.29 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

lirmm-00355048 , version 1 (21-01-2009)
lirmm-00355048 , version 2 (10-04-2009)


  • HAL Id : lirmm-00355048 , version 2


Gilles Simonin, Rodolphe Giroudeau, Jean-Claude König. 2-Cover Definition for a Coupled-Tasks Scheduling Problem. [Research Report] RR-09003, LIRMM. 2009. ⟨lirmm-00355048v2⟩
272 View
98 Download


Gmail Mastodon Facebook X LinkedIn More