A note on the complexity of scheduling coupled tasks on a single processor (2001)
Blazewicz,Jacek, Ecker,Klaus, Kis,Tamás, Tanas,Michal
This paper considers a problem of coupled task scheduling on one processor, where all processing times are equal to 1, the gap has exact length h, precedence constraints are strict and the criterion...