Solving multiprocessor scheduling problem with GEO metaheuristic

We propose a solution of the multiprocessor scheduling problem based on applying a relatively new metaheuristic called generalized extremal optimization (GEO). GEO is inspired by a simple coevolutionary model known as Bak-Sneppen model. The model assumes existing of an ecosystem consisting of N species. Evolution in this model is driven by a process in which the weakest species in the ecosystem, together with its nearest neighbors is always forced to mutate. This process shows characteristic of a phenomenon called a punctuated equilibrium which is observed in evolutionary biology. We interpret the multiprocessor scheduling problem in terms of the Bak-Sneppen model and apply the GEO algorithm to solve the problem. We show that the proposed optimization technique is simple and yet outperforms both genetic algorithm (GA)-based and particle swarm optimization (PSO) algorithm-based approaches to the multiprocessor scheduling problem.