A Hybrid Grouping Genetic Algorithm for Multiprocessor Scheduling

  • Alok Singh
  • Marc Sevaux
  • André Rossi
Part of the Communications in Computer and Information Science book series (CCIS, volume 40)


This paper describes a hybrid grouping genetic algorithm for a multiprocessor scheduling problem, where a list of tasks has to be scheduled on identical parallel processors. Each task in the list is defined by a release date, a due date and a processing time. The objective is to minimize the number of processors used while respecting the constraints imposed by release dates and due dates. We have compared our hybrid approach with two heuristic methods reported in the literature. Computational results show the superiority of our hybrid approach over these two approaches. Our hybrid approach obtained better quality solutions in shorter time.


Combinatorial optimization grouping genetic algorithm heuristic multiprocessor scheduling 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Gajski, D.D., Dutt, N.D., Wu, A.C.-H., Lin, S.Y.-L.: High Level Synthesis: Introduction to Chip and System Design. Kluwer Academic Publishers, Norwell (1992)CrossRefGoogle Scholar
  2. 2.
    Lee, J.-H., Hsu, Y.-C., Lin, Y.-L.: A New Integer Linear Programming Formulation for the Scheduling Problem in Data Path Synthesis. In: Proceedings of the 1989 IEEE International Conference on Computer-Aided Design, pp. 20–23. IEEE Computer Society Press, New York (1989)Google Scholar
  3. 3.
    Sevaux, M., Sörensen, K.: A Tabu Search Method for High Level Synthesis. In: Proceedings of the Francoro V / Roadef 2007, Grenoble, France, pp. 395–396 (2007)Google Scholar
  4. 4.
    Sevaux, M., Thomin, P.: Heuristics and Metaheuristics for Parallel Machine Scheduling: A Computational Evaluation. In: Proceedings of the 4th Metaheuristics International Conference (MIC 2001), Porto, Portugal, pp. 16–20 (2001)Google Scholar
  5. 5.
    Sevaux, M., Singh, A., Rossi, A.: Tabu Search for Multiprocessor Scheduling: Application to High Level Synthesis. Communicated to Asia Pacific Journal of Operational Research (2009)Google Scholar
  6. 6.
    Falkenauer, E.: New Representations and Operators for GAs Applied to Grouping Problems. Evolutionary Computation 2, 123–144 (1992)CrossRefGoogle Scholar
  7. 7.
    Falkenauer, E.: Genetic Algorithms and Grouping Problems. John Wiley & Sons, Chichester (1998)Google Scholar
  8. 8.
    Davis, L.: Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York (1991)Google Scholar
  9. 9.
    Singh, A., Gupta, A.K.: Two Heuristics for the One-Dimensional Bin-Packing Problem. OR Spectrum 29, 765–781 (2007)CrossRefGoogle Scholar
  10. 10.
    Rossi, A., Sevaux, M.: Mixed-Integer Linear Programming Formulation for High Level Synthesis. In: Proceedings of the Eleventh International Workshop on Project Management and Scheduling, Istanbul, Turkey, pp. 222–226 (2008)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Alok Singh
    • 1
  • Marc Sevaux
    • 2
  • André Rossi
    • 2
  1. 1.Department of Computer and Information Sciences, School of Mathematics and Computer/ Information SciencesUniversity of HyderabadHyderabadIndia
  2. 2.Lab-STICCUniversité de Bretagne-Sud, UEB, Centre de RechercheLorient CedexFrance

Personalised recommendations