Complexity and Approximation for Precedence Constrained Scheduing Problems with Large Communication Delays - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier
Conference Papers Year : 2005

Complexity and Approximation for Precedence Constrained Scheduing Problems with Large Communication Delays

Rodolphe Giroudeau
Algorithmes et Performance des Réseaux
CV
Jean-Claude König
Algorithmes et Performance des Réseaux
CV
Feryal Windal
Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Jérôme Palaysi
  • Function : Author
  • PersonId : 938554
Algorithmes et Performance des Réseaux

Domains

Operations Research [math.OC]

Rodolphe Giroudeau  : Connect in order to contact the contributor

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00402647

Submitted on : Tuesday, July 7, 2009-8:41:18 PM

Last modification on : Friday, March 24, 2023-2:52:52 PM

Consult on ISTEX platform

Dates and versions

lirmm-00402647 , version 1 (07-07-2009)

Identifiers

Cite

Rodolphe Giroudeau, Jean-Claude König, Feryal Windal, Jérôme Palaysi. Complexity and Approximation for Precedence Constrained Scheduing Problems with Large Communication Delays. Euro-Par: European Conference on Parallel Computing, Aug 2005, Lisboa, Portugal. pp.252-261, ⟨10.1007/11549468_30⟩. ⟨lirmm-00402647⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS LIRMM APR APR-LIRMM MIPS UNIV-MONTPELLIER
75 View
0 Download

Altmetric

Share

More