International Journal of Computer Theory and Engineering

Editor-In-Chief: Prof. Mehmet Sahinoglu
Frequency: Quarterly
ISSN: 1793-8201 (Print), 2972-4511 (Online)
Publisher:IACSIT Press

OPEN ACCESS
4.0
CiteScore

IJIET 2013 Vol.5(2): 377-382
doi: 10.7763/IJCTE.2013.V5.713

An Efficient and Robust Genetic Algorithm for Multiprocessor Task Scheduling

Sachi Gupta1 , Gaurav Agarwal1 , Vikas Kumar2

  • 1Computer Science and Information Technology Deptt. Krishna Institute of Management and Technology, Moradabad, India
  • 2Computer Science Deptt, Moradabad Institute of Technology Moradabad, India.

Abstract

The general problem of multiprocessor scheduling can be stated as scheduling a task graph onto a multiprocessor system so that schedule length can be optimized. Task scheduling in multiprocessor system is a NP-complete problem. In literature, several heuristic methods have been developed that obtain suboptimal solutions in less than the polynomial time. Recently, Genetic algorithms have

Keywords

  • Genetic algorithm
  • fitness function
  • multi-processor system
  • NP-complete etc
713-L329

How to Cite

Copied

Sachi Gupta, Gaurav Agarwal, and Vikas Kumar, "An Efficient and Robust Genetic Algorithm for Multiprocessor Task Scheduling," International Journal of Computer Theory and Engineering, vol. 5, no. 2, pp. 377-382, 2013. https://doi.org/10.7763/IJCTE.2013.V5.713

Copyright & License

Copyright © 2013 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).

Article Metrics in Dimensions

Menu