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

Authors: Gilles Simonin; Rodolphe Giroudeau; Jean-Claude König

Addresses: CNRS, LAAS, 7 avenue du colonel Roche, F-31400 Toulouse, France; Univ de Toulouse, LAAS, F-31400 Toulouse, France ' LIRMM-UM2-CNRS UMR 5056, 161 rue Ada, 34392 Montpellier, Cedex 5, France ' LIRMM-UM2-CNRS UMR 5056, 161 rue Ada, 34392 Montpellier, Cedex 5, France

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/12;) in the presence (resp. absence) of triangles.

Keywords: coupled-task scheduling; compatibility graphs; additional tasks; complexity; polynomial-time approximation; coupled tasks; path covering; star packing; non-covered vertices.

DOI: 10.1504/IJPS.2013.059680

International Journal of Planning and Scheduling, 2013 Vol.1 No.4, pp.285 - 300

Received: 04 Oct 2012
Accepted: 23 Jul 2013

Published online: 05 Mar 2014 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article