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

Dalila Tayachi; Philippe Chrétienne; Khaled Mellouli

RAIRO - Operations Research (2010)

  • Volume: 34, Issue: 4, page 467-485
  • ISSN: 0399-0559

Abstract

top
This paper deals with the problem of scheduling n tasks on m identical processors in the presence of communication delays. A new approach of modelisation by a decision graph and a resolution by a tabu search method is proposed. Initial solutions are constructed by list algorithms, and then improved by a tabu algorithm operating in two phases. The experiments carried on arbitrary graphs show the efficiency of our method and that it outperformed the principle existent heuristics.

How to cite

top

Tayachi, Dalila, Chrétienne, Philippe, and Mellouli, Khaled. "Une méthode tabou pour l'ordonnancement multiprocesseur avec délais de communication." RAIRO - Operations Research 34.4 (2010): 467-485. <http://eudml.org/doc/197787>.

@article{Tayachi2010,
abstract = { This paper deals with the problem of scheduling n tasks on m identical processors in the presence of communication delays. A new approach of modelisation by a decision graph and a resolution by a tabu search method is proposed. Initial solutions are constructed by list algorithms, and then improved by a tabu algorithm operating in two phases. The experiments carried on arbitrary graphs show the efficiency of our method and that it outperformed the principle existent heuristics. },
author = {Tayachi, Dalila, Chrétienne, Philippe, Mellouli, Khaled},
journal = {RAIRO - Operations Research},
keywords = {Scheduling problems; communication delays; decision graph; tabu search; list algorithm.; scheduling problems; list algorithm},
language = {eng},
month = {3},
number = {4},
pages = {467-485},
publisher = {EDP Sciences},
title = {Une méthode tabou pour l'ordonnancement multiprocesseur avec délais de communication},
url = {http://eudml.org/doc/197787},
volume = {34},
year = {2010},
}

TY - JOUR
AU - Tayachi, Dalila
AU - Chrétienne, Philippe
AU - Mellouli, Khaled
TI - Une méthode tabou pour l'ordonnancement multiprocesseur avec délais de communication
JO - RAIRO - Operations Research
DA - 2010/3//
PB - EDP Sciences
VL - 34
IS - 4
SP - 467
EP - 485
AB - This paper deals with the problem of scheduling n tasks on m identical processors in the presence of communication delays. A new approach of modelisation by a decision graph and a resolution by a tabu search method is proposed. Initial solutions are constructed by list algorithms, and then improved by a tabu algorithm operating in two phases. The experiments carried on arbitrary graphs show the efficiency of our method and that it outperformed the principle existent heuristics.
LA - eng
KW - Scheduling problems; communication delays; decision graph; tabu search; list algorithm.; scheduling problems; list algorithm
UR - http://eudml.org/doc/197787
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.