The invention relates to a particle swarm scheduling method for a divisible task. The method comprises the steps of after dividing the task to be scheduled into sub-tasks, using each randomly generated task distribution scheme as a particle, using the time performance corresponding to each task distribution scheme as the fitness of the corresponding particle, computing the mutual movement speed between the particles by using the differences between the particle fitnesses, performing evolution on the particle swarm for many times, and selecting the particle with the best fitness from the result of the many times of evolution; and at last, through combining with the overhead value, scheduling the sub-tasks in the task distribution scheme corresponding to the particle with the best fitness.