柔性作业调度的串并行模型对比与求解  

Symbiotic evolutionary algorithm for parallel job shop scheduling problem

作　　者：苏兆锋[1] 邱洪泽[2] 

机构地区：[1]鲁东大学管理学院,山东烟台264025 [2]山东大学计算机学院,济南250061

出　　处：《计算机工程与应用》2008年第9期235-238,共4页Computer Engineering and Applications

基　　金：国家自然科学基金(the National Natural Science Foundation of China under Grant No.60603007)

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

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

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]