Volume 36, Number 1, January-March 2002
|Page(s)||21 - 36|
|Published online||15 July 2002|
On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications
Laboratoire de Méthodes Informatiques (LaMI),
Université d'Evry-Val-d'Essonne, UMR 8042 du CNRS, 523 place des Terrasses,
Immeuble ÉVRY-II, 91000 Evry, France; email@example.com.
2 LIRMM, Université de Montpellier II, UMR 5506 du CNRS, 161 rue Ada, 34392 Montpellier Cedex 5, France; firstname.lastname@example.org.
We consider the unit execution time unit communication time (UET-UCT) scheduling model with hierarchical communica tions [CITE], and we study the impact of the hierarchical communications hypothesis on the hardness of approximation. We prove that there is no polynomial time approximation algorithm with performance guarantee smaller than 5/4 (unless P = NP). This result is an extension of the result of Hoogeveen et al. [CITE] who proved that there is no polynomial time ρ-approximation algorithm with p < 7/6 for the classical UET-UCT scheduling problem with homogeneous communication delays and an unrestricted number of identical machines.
Mathematics Subject Classification: 90B35
Key words: Scheduling / hierarchical communications / non-approxima bility.
© EDP Sciences, 2002
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.