Abstract: Jobs with high production flexibility will lead to much more process plans and enhance the difficult of scheduling problem.The optimality of job shop scheduling depends on the result of process planning.Symbiotic Evolutionary Algorithm（SEA） is a good alternative for dealing with the problem usually.In this paper，a parallel Job Shop Scheduling Problem（JSSP） model is introduced on the basis of serial model.Traditional SEA is adjusted to deal with the parallel JSSP model.A complex job shop scheduling problems is selected as the test-bed problem for symbiotic evolutionary algorithm to deal with the two types JSSP.Compared with serial model，performance of the symbiotic evolutionary algorithm has relations with the type and scale of the parallel JSSP model.

Key words: flexible, parallel, job shop scheduling problem, symbiotic evolutionary algorithm

摘要： 作业处理中的柔性使得作业调度更为灵活，作业中操作的执行顺序满足拓扑排序是作业调度的前提。是否允许没有优先关系的操作在不同的机器上同时执行是区分串行和并行调度的条件。文中以共生进化算法求解一个复杂的作业调度模型为例，给出了算法实现串行调度和并行调度的具体区别，并给出了串行和并行调度的结果。结果表明，并行相对于串行对算法效率的提高与柔性大小相关，与作业的规模成反比。

关键词: 柔性, 并行, 作业调度, 共生进化算法