Une méthode tabou pour l'ordonnancement multiprocesseur avec délais de communication
Une méthode tabou pour l'ordonnancement multiprocesseur avec délais de communication
This paper deals with the problem of scheduling tasks on 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.
Page 1