Gravitational Search Algorithm Based Task Scheduling for Multi-Processor Systems

With the technological advancement in science, education, engineering, and research the scheduling problem is getting more attention to the researchers. Scheduling is a well known Non-deterministic Polynomial(NP)-complete problem. In this paper, we have proposed a solution to the scheduling problem using a well known meta-heuristic approach known as Gravitational Search Algorithm (GSA). The proposed GSA based scheduling technique considers multiple conflicting objectives as minimization of makespan, load-balancing, and maximization of resource utilization. The proposed work is extensively simulated on standard benchmark data sets. The simulation result shows better performance of the proposed algorithm than the existing algorithms such as Genetic Algorithm(GA) and Particle Swarm Optimization(PSO).