Solving the P/Prec, pj,Cij/Cmax Using an Evolutionary Algorithm
- 631 Downloads
In this chapter, we tackle the problem of scheduling a set of related tasks on a set of identical processors taking into account the communication delays with the objective of minimizing the maximal completion time . This problem is well known as NP-Hard. As Particle swarm optimization PSO is a promising approach for solving NP-complete problems due to its simple implementation, fast convergence and its few parameters to adjust, the main contribution of this research is to use for the first time PSO to solve the multiprocessor scheduling problem with communication delays . The proposed approach HEA-LS is a hybrid algorithm involving particle swarm optimization PSO and local search algorithm LS. Experiments conducted on several benchmarks known in the literature prove the effectiveness of our approach and show that it compares very well to the state of the art methods.
KeywordsScheduling Communication delays Evolutionary algorithm Hybridizing Particle swarm Local search
I would like to thank Mr. Aziz Moukrim professor at Université de Technologie de Compiegne UTC in France for his helpful remarks and suggestions to improve this work.
- 3.A. Daddi-Moussa, Méthode exacte pour les problèmes avec délais de communication. Thèse de Doctorat de l’Université de Paris VI (1997)Google Scholar
- 5.T. Davidovic, P. Hansen, N. Mladenovic, Variable neighborhood search for the multiprocessor scheduling problem with communication delays, in MIC 2001, Porto (2001)Google Scholar
- 7.J.J. Hwang, Y.C. Chow, F.D. Angers, C.Y. Lee, Scheduling graphs in systems with interprocessor communication times. J. Comput. 18, 244–257 (1989)Google Scholar
- 8.J. Kennedy, R. Eberhart, Particle swarm optimization, in Proceeding of IEEE International Conference on Neural Networks (1995), pp. 1942–1948Google Scholar