Abstract: A method based on particle swarm optimization (PSO) for multiprocessor scheduling is proposed in this paper. The mechanisms involved are employing original particle swarm algorithm with mutation and swarm particle vector is converted to priority-based scheduling model. The simulation results demonstrate that the proposed algorithm is superior to some heuristic algorithms such as simulated annealing and improve the abilities of seeking the global search and evolution speed.