Une méthode tabou pour l'ordonnancement multiprocesseur avec délais de communication

DOI10.1051/RO:2000125zbMath0979.90058OpenAlexW2001878933MaRDI QIDQ2713147

Khaled Mellouli, Philippe Chrétienne, Dalila Tayachi

Publication date: 6 May 2001

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

Full work available at URL: https://eudml.org/doc/197787

zbMATH Keywords

tabu searchscheduling problemscommunication delaysdecision graphlist algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Search theory (90B40) Deterministic scheduling theory in operations research (90B35)

This page was built for publication: Une méthode tabou pour l'ordonnancement multiprocesseur avec délais de communication