Abstract: In this paper,the concept of crflatness was proposed based on analyzing the multiprocessors scheduling problem, and then introduced it into the multiprocessors scheduling problem. Finally, a new algorithm based on the concept of a-flatness was proposed to solved the multiprocessors scheduling problem In this algorithm, the job set was flatting at first,and then solved the new problem obtained by the first step, finally an approximate solution for the original scheduling problem was obtained. The experimental results show that the solution obtained by this algorithm is good,and compared with the heuristic algorithm the result obtained by this algorithm is more stable.

Key words: Multiprocessors scheduling,crflatness,Planarization processing,Scheduling algorithm