Approximating a coupled-task scheduling problem in the presence of compatibility graph and additional tasks Online publication date: Mon, 30-Jun-2014
by Gilles Simonin; Rodolphe Giroudeau; Jean-Claude König
International Journal of Planning and Scheduling (IJPS), Vol. 1, No. 4, 2013
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.
Online publication date: Mon, 30-Jun-2014
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Planning and Scheduling (IJPS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email email@example.com