Parameterized complexity of a coupled-task scheduling problem
S Bessy, R Giroudeau - Journal of Scheduling, 2019 - Springer
In this article, we investigate the parameterized complexity of coupled-task scheduling in the
presence of compatibility constraints given by a compatibility graph. In this model, each task …
presence of compatibility constraints given by a compatibility graph. In this model, each task …
Approximating a coupled-task scheduling problem in the presence of compatibility graph and additional tasks
G Simonin, R Giroudeau… - International Journal of …, 2013 - inderscienceonline.com
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 …
graph and additional tasks on a single processor. We investigate a specific configuration, in …
Some complexity and approximation results for coupled-tasks scheduling problem according to topology
B Darties, R Giroudeau, JC König… - RAIRO-Operations …, 2016 - numdam.org
We consider the makespan minimization coupled-tasks problem in presence of compatibility
constraints with a specified topology. In particular, we focus on stretched coupled-tasks, ie …
constraints with a specified topology. In particular, we focus on stretched coupled-tasks, ie …
Scheduling stretched coupled-tasks with compatibilities constraints: model, complexity and approximation results for some class of graphs
We tackle the makespan minimization coupled-tasks problem in presence of compatibility
constraints. In particular, we focus on stretched coupled-tasks,{\it ie} coupled-tasks having …
constraints. In particular, we focus on stretched coupled-tasks,{\it ie} coupled-tasks having …
[PDF][PDF] Benoit Darties1, Rodolphe Giroudeau2, Jean-Claude König2 and Gilles Simonin3
JC König, G Simonin - RAIRO-Oper. Res, 2016 - academia.edu
We consider the makespan minimization coupled-tasks problem in presence of compatibility
constraints with a specified topology. In particular, we focus on stretched coupled-tasks, ie …
constraints with a specified topology. In particular, we focus on stretched coupled-tasks, ie …
Approximation algorithm for constrained coupled-tasks scheduling problem
We tackle the makespan minimization coupled-tasks problem in presence of compatibility
constraints. In particular, we focus on stretched coupled-tasks, ie coupled-tasks having the …
constraints. In particular, we focus on stretched coupled-tasks, ie coupled-tasks having the …