16 citations · 19 across the 3 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2017★ 3 cited
Some complexity and approximation results for coupled-tasks scheduling problem according to topology
Benoit Darties, Rodolphe Giroudeau, Jean-Claude König +1
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,…
cs.CC2017
Bounds and approximation results for scheduling coupled-tasks with compatibility constraints
Rodolphe Giroudeau, Jean-Claude König, Benoit Darties +1
This article is devoted to propose some lower and upper bounds for the coupled-tasks scheduling problem in presence of compatibility constraints according to classical complexity h…