Scheduling an interval ordered precedence graph with communication delays and a limited number of processors

DOI10.1051/RO/2013028zbMath1282.90072OpenAlexW2099799328MaRDI QIDQ2845034

Benoît Dupont de Dinechin, Lucian Finta, Fadi Kacem, Alix Munier Kordon

Publication date: 22 August 2013

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=RO_2013__47_1_73_0/

zbMATH Keywords

schedulingcombinatorial optimizationapproximation and complexity

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

The equivalence of two classical list scheduling algorithms for dependent typed tasks with release dates, due dates and precedence delays

This page was built for publication: Scheduling an interval ordered precedence graph with communication delays and a limited number of processors