Found 1 document(s)
Page 1 of 1
-
Some complexity and approximation results for coupled-tasks scheduling problem according to topologyWe consider the makespan minimization coupled-tasks problem in presence of compatibility constraints with a specified topology. In particular, we focus on stretched coupled-tasks, i.e. coupled-tasks having the same sub-t...