Genetic Algorithm for Multiprocessor Task Scheduling
MultiProcessor Task Scheduling (MPTS) is an important and computationally difficult problem. Multiprocessors have emerged as a powerful computing means for running real-time applications especially due to limitation of uni-processor system for not having sufficient enough capability to execute all the tasks. This paper describes multiprocessor task scheduling in the form of permutation flow shop scheduling, which has an objective function for minimizing the make span. Here, the authors will conclude how the performance of genetic algorithms (value of the make span of the schedule) varies with the variation of Genetic Algorithm (GA) control parameters (population size, crossover probability and mutation probability).