Scheduling independent tasks: Bee Colony Optimization approach

Abstract

The problem of static scheduling of independent tasks on homogeneous multiprocessor systems is studied in this paper. The problem is solved by the bee colony optimization (BCO). The BCO algorithm belongs to the class of stochastic swarm optimization methods. The proposed algorithm is inspired by the foraging habits of bees in the nature. The BCO algorithm was able to obtain the optimal value of objective function in all small to medium size test problems. The CPU times required to find the best solutions by the BCO are acceptable.