Skip to Main content Skip to Navigation
Reports

Complexity and Approximation for the Precedence Constrained Scheduling Problem with Large Communications Delays

Rodolphe Giroudeau 1 Jean-Claude König 1 F.K. Moulai Jérôme Palaysi 1
1 APR - Algorithmes et Performance des Réseaux
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : Complexity and Approximation for the Precedence Constrained Scheduling Problem with Large Communications Delays
Mots-clés : ORDONNANCEMENT
Document type :
Reports
Complete list of metadata

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00106681
Contributor : Christine Carvalho de Matos <>
Submitted on : Monday, October 16, 2006 - 9:50:32 AM
Last modification on : Monday, February 11, 2019 - 11:50:15 AM
Long-term archiving on: : Tuesday, April 6, 2010 - 5:49:15 PM

File

Identifiers

  • HAL Id : lirmm-00106681, version 1

Collections

Citation

Rodolphe Giroudeau, Jean-Claude König, F.K. Moulai, Jérôme Palaysi. Complexity and Approximation for the Precedence Constrained Scheduling Problem with Large Communications Delays. [Research Report] 05025, LIRMM. 2005. ⟨lirmm-00106681⟩

Share

Metrics

Record views

174

Files downloads

122