Theoretical aspects of scheduling coupled-tasks in the presence of compatibility graph

MaRDI QIDQ2865876zbMATH OpenFDO

Authors G. Simonin, Rodolphe Giroudeau, B. Darties, Jean-Claude König

Publication date 11 December 2013

Published in Algorithmic Operations Research (Search for Journal in Brave)

Full work available at URL http://journals.hil.unb.ca/index.php/AOR/article/view/18602

zbMATH Keywords

complexityapproximation algorithmschedulingcoupled-tasks

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor
• Coupled-tasks in presence of bipartite compatibilities graphs
• Some complexity and approximation results for coupled-tasks scheduling problem according to topology
• Parameterized complexity of a coupled-task scheduling problem
• Scheduling of coupled tasks with unit processing times

Cited in

(4)

• Coupled-tasks in presence of bipartite compatibilities graphs
• Parameterized complexity of a coupled-task scheduling problem
• Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor
• Some complexity and approximation results for coupled-tasks scheduling problem according to topology

This page was built for publication: Theoretical aspects of scheduling coupled-tasks in the presence of compatibility graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2865876)