On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications
RAIRO-Oper. Res., 36 1 (2002) 21-36
Published online: 15 July 2002
DOI: 10.1051/ro:2002003