On the hardness of approximating the UET-UCT scheduling problem with hierarchical communicationsEvripidis Bampis, R. Giroudeau and J.-C. KönigRAIRO-Oper. Res., 36 1 (2002) 21-36DOI: https://doi.org/10.1051/ro:2002003