On the Hardness of Approximating the Precedence Constrained Multiprocessor Scheduling Problem with Hierarchical Communications - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Journal Articles RAIRO - Operations Research Year : 2002

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

Evripidis Bampis
  • Function : Author
  • PersonId : 855947
Rodolphe Giroudeau
Jean-Claude König

Dates and versions

lirmm-00268637 , version 1 (01-04-2008)

Identifiers

Cite

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, 2002, 36 (1), pp.21-36. ⟨10.1051/ro:2002003⟩. ⟨lirmm-00268637⟩
55 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More