Multiprocessor task scheduling is process of allocating some tasks to several processors so that the overall time of tasks completion is to be minimized while precedence constraint are preserved. Multiprocessor task scheduleng is NP-complete problem that means it takes a long time to solve. In this paper, by simulating eurygaster life a novel approach has been proposed to solve this problem. These insects divide the search area of problem into several sections and investigate each section separately. Evaluation results show that proposed approach is more useful and faster that heuristics methods like genetic algorithm and PSO.
