Review : Time complexities in genetic algorithm with the use of multiprocessor task scheduling

  • Jeevana Jyothi Pujari , M Varalakshmi, Mahammad Salma Sultana, Kowtharapu Radha


          The common difficulty of multiprocessor scheduling can be assured as scheduling a task diagram onto a multiprocessor system which in turn can optimize the scheduling length. The time taken to solve a Task scheduling problem is  NP-complete. In literature, a number of heuristic methods had been implemented that obtain suboptimal solutions in less than the polynomial time. In recent times  Genetic algorithms  (GA) have received much understanding as they are vigorous and guarantee for a fine solution. This paper provides a report of  review of the literature about GA applied to the multiprocessor task scheduling problem..