计算机工程与应用 ›› 2008, Vol. 44 ›› Issue (32): 197-199.DOI: 10.3778/j.issn.1002-8331.2008.32.059

• 工程与应用 • 上一篇    下一篇

特殊工艺约束并行多机双目标调度问题的研究

何桂霞1,高家全1,王雨顺2   

  1. 1.浙江工业大学 之江学院,杭州 310024
    2.南京师范大学 数学与计算机科学学院,南京 210097
  • 收稿日期:2007-12-03 修回日期:2008-01-29 出版日期:2008-11-11 发布日期:2008-11-11
  • 通讯作者: 何桂霞

Research on bi-objective scheduling problem subjected to special process constraint on parallel machines

HE Gui-xia1,GAO Jia-quan1,WANG Yu-shun2   

  1. 1.Zhijiang College,Zhejiang University of Technology,Hangzhou 310024,China
    2.School of Mathematics and Computer Science,Nanjing Normal University,Nanjing 210097,China
  • Received:2007-12-03 Revised:2008-01-29 Online:2008-11-11 Published:2008-11-11
  • Contact: HE Gui-xia

摘要: 针对在特殊工艺约束下,非等同并行多机总完工时间最小和总拖后惩罚最小双目标调度问题(BOSP),设计了一个双目标调度模型,进而构造了一个基于向量组编码的遗传算法。此算法的编码方法简单,能有效地反映实际调度方案,收敛速度快。同时为了更好地适应调度实时性和解大型此类问题的需要,在基于遗传算法自然并行性特点的基础上,实现了主从式控制网络模式下并行遗传算法。仿真结果表明,此算法是有效的,优于普通的遗传算法,具有较高的并行性,并能适用于解大型此类调度问题。

关键词: 双目标, 调度, 特殊工艺约束, 并行机, 并行遗传算法

Abstract: The problem of non-identical parallel multi-machine scheduling subjected to special process constraint with the objectives of minimizing the total completion time and the total tardiness penalty(BOSP) is considered.To BOSP,a bi-objective scheduling model is presented in this paper,and a parallel genetic algorithm based on a vector group coding method is also constructed in order to effectively solve this model.Its coding method is simple and can effectively reflect the virtual scheduling policy and has better convergence.Meantime,under the mode of master-slave control networks,parallel genetic algorithm is applied in order to adapt to lager scale and real-time scheduling problems.Numerical experiments show that it is efficient,and is better than the common genetic algorithm,and has the better parallel efficiency.A much better prospect of application can be optimistically expected.

Key words: bi-objective, scheduling, special process constraint, parallel machines, parallel genetic algorithm