Approximating a coupled-task scheduling problem in the presence of compatibility graph and additional tasks - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Journal Articles International Journal of Planning and Scheduling Year : 2013

Approximating a coupled-task scheduling problem in the presence of compatibility graph and additional tasks

Abstract

This paper introduces a coupled-task scheduling problem in the presence of a compatibility graph and additional tasks on a single processor. We investigate a specific configuration, in which the coupled-tasks have an idle time of two. The complexity of these problems will be studied according to the presence or absence of triangles in the compatibility graph. Using the results given by Kelmans (1997) on an optimal packing problem of induced stars in a graph, we develop a polynomial-time algorithm which consists of minimising 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 called the two-cover technique. According to the compatibility graph type, the two-cover technique provides a polynomial-time ρ-approximation algorithm with ρ = 10 9 (resp. ρ = 13 ) in the presence (resp. absence) of triangles.
No file

Dates and versions

lirmm-00952599 , version 1 (27-02-2014)

Identifiers

Cite

Rodolphe Giroudeau, Jean-Claude König, Gilles Simonin. Approximating a coupled-task scheduling problem in the presence of compatibility graph and additional tasks. International Journal of Planning and Scheduling, 2013, 1 (en cours de publication) (4), pp.285-300. ⟨10.1504/IJPS.2013.059680⟩. ⟨lirmm-00952599⟩
158 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More