Article references

Articles citing this article

The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).

Cited article:

On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications

Evripidis Bampis, R. Giroudeau, J.-C. König

RAIRO-Oper. Res., 36 1 (2002) 21-36

Published online: 2002-07-15

DOI: https://doi.org/10.1051/ro:2002003

This article has been cited by the following article(s):

Scheduling for Parallel Processing

Maciej Drozdowski
Computer Communications and Networks, Scheduling for Parallel Processing 209 (2009)
https://doi.org/10.1007/978-1-84882-310-5_6

General scheduling non-approximability results in presence of hierarchical communications

R. Giroudeau and J.C. König
European Journal of Operational Research 184 (2) 441 (2008)
https://doi.org/10.1016/j.ejor.2006.11.020

R. Giroudeau and J.C. Konig
312 (2004)
https://doi.org/10.1109/ISPDC.2004.27

Scheduling Tasks with Small Communication Delays for Clusters of Processors

E. Bampis, R. Giroudeau and A. Kononov
Annals of Operations Research 129 (1-4) 47 (2004)
https://doi.org/10.1023/B:ANOR.0000030681.44697.7f