auteur:

Darties, Benoît and Giroudeau, Rodolphe and K{"{o}}nig, Jean-Claude and Simonin, Gilles

titre:

Some complexity and approximation results for coupled-tasks scheduling problem according to topology

titre_publi:

RAIRO, Operations Research

annee:

2016

mois:

equipe:

a:1:{i:0;s:23:"Combinatoire - Réseaux";}

type_de_document:

Revue internationale

pages:

781--795

organisation:

adresse:

mot_cle:

isbn:

doi:

url:

volume:

50 numéro

note:

editeur:

kc_data:

a:8:{i:0;s:0:"";s:4:"mode";s:0:"";s:3:"css";s:0:"";s:9:"max_width";s:0:"";s:7:"classes";s:0:"";s:9:"thumbnail";s:0:"";s:9:"collapsed";s:0:"";s:9:"optimized";s:0:"";}

kc_raw_content: