Advertisement

Solving the P/Prec, pj,Cij/Cmax Using an Evolutionary Algorithm

  • Dalila TayachiEmail author
Chapter
  • 631 Downloads
Part of the Operations Research/Computer Science Interfaces Series book series (ORCS, volume 62)

Abstract

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.

Keywords

Scheduling Communication delays Evolutionary algorithm Hybridizing Particle swarm Local search 

Notes

Acknowledgements

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.

References

  1. 1.
    P. Chretienne, A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints. Eur. J. Oper. 43, 225–230 (1989)CrossRefGoogle Scholar
  2. 2.
    J.-Y. Colin, P. Chretienne, CPM scheduling with small communication delays. Oper. Res. 39, 680–684 (1995)CrossRefGoogle Scholar
  3. 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
  4. 4.
    T. Davidovic, T. Crainic, Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems. Comput. Oper. Res. 33, 2155–2177 (2006)CrossRefGoogle Scholar
  5. 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
  6. 6.
    D.-C. Dang, R.N. Guibadj, A. Moukrim, An effective PSO inspired algorithm for the team orienteering problem. Eur. J. Oper. Res. 229, 332–344 (2013)CrossRefGoogle Scholar
  7. 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. 8.
    J. Kennedy, R. Eberhart, Particle swarm optimization, in Proceeding of IEEE International Conference on Neural Networks (1995), pp. 1942–1948Google Scholar
  9. 9.
    U. Kwok, I. Ahmad, Efficient scheduling of arbitrary task graphs to multiprocessors using a parallel genetic algorithm. J. Parallel Distrib. Comput. 47, 58–77 (1997)CrossRefGoogle Scholar
  10. 10.
    U. Kwok, I. Ahmad, Benchmarking and comparison of the task graph scheduling algorithms. J. Parallel Distrib. Comput. 59, 381–422 (1999)CrossRefGoogle Scholar
  11. 11.
    F. Omara, M. Arafa, Genetic algorithms for task scheduling problem. J. Parallel Distrib. Comput. 70, 13–22 (2010)CrossRefGoogle Scholar
  12. 12.
    V.J.R. Smith, UET scheduling with Unit interprocessor communication delays. Discret. Appl. Math. 18, 55–71 (1987)CrossRefGoogle Scholar
  13. 13.
    D. Tayachi, P. Chretienne, K. Mellouli, Une méthode tabou pour l’ordonnancement multiprocesseur avec délais de communication. RAIRO Oper. Res. 34, 467–485 (2000)CrossRefGoogle Scholar
  14. 14.
    B. Veltman, B.J. Lageweg, J.K. Lenstra, Multiprocessor scheduling with communication delays. Parallel Comput. 16, 173–182 (1990)CrossRefGoogle Scholar
  15. 15.
    M. Wu, D. Gajski, Hypertool: a programming aid for message passing systems. IEEE Trans. Parallel Distrib. Syst. 1(3), 330–343 (1990)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG 2018

Authors and Affiliations

  1. 1.Ecole Supérieure de Commerce de TunisUniversité de la ManoubaManoubaTunisia

Personalised recommendations