Some complexity and approximation results for coupled-tasks scheduling problem according to topology
RAIRO-Oper. Res., 50 4-5 (2016) 781-795
Published online: 03 November 2016
DOI: 10.1051/ro/2016034