Skip to Main content Skip to Navigation
Journal articles

On the Hardness of Approximating the Precedence Constrained Multiprocessor Scheduling Problem with Hierarchical Communications

Evripidis Bampis 1 Rodolphe Giroudeau 2 Jean-Claude König 2
2 APR - Algorithmes et Performance des Réseaux
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Document type :
Journal articles
Complete list of metadata

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00268637
Contributor : Christine Carvalho de Matos <>
Submitted on : Tuesday, April 1, 2008 - 9:28:13 AM
Last modification on : Monday, February 11, 2019 - 11:50:15 AM

Identifiers

  • HAL Id : lirmm-00268637, version 1

Citation

Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König. On the Hardness of Approximating the Precedence Constrained Multiprocessor Scheduling Problem with Hierarchical Communications. RAIRO - Operations Research, EDP Sciences, 2002, 36 (1), pp.21-36. ⟨lirmm-00268637⟩

Share

Metrics

Record views

120