采用遗传算法的双资源柔性车间调度问题研究  

Study of flexible job shop scheduling problems with dual-resource based on genetic algorithm

作　　者：袁志玲[1] 袁逸萍[1] 孙文磊[1] 田书广[1] 

机构地区：[1]新疆大学机械工程学院,乌鲁木齐830047

出　　处：《现代制造工程》2013年第12期21-25,共5页Modern Manufacturing Engineering

基　　金：国家自然科学基金项目(51065028);中国博士后特别资助项目(201104701);新疆维吾尔自治区"十二五"重大专项项目(201130110-1);新疆维吾尔自治区自然科学基金项目(2010211A11)

摘　　要：针对实际作业车间中所加工工件的工序数不尽相同、各工件的各道工序所使用的机器资源不唯一,以及各工人操作机器的技术水平有很大差异的状况,以产品的生产周期最短为目标,提出了同时考虑工序排序、机器选择和工人选择的遗传算法,此算法采用三子串的方式来进行编码,并且结合双资源柔性车间调度问题的特点,设计了独特的交叉和变异方式,实例仿真分析说明了该算法的有效性。According to the practical job shop, as the number of the processes of the processing parts is different, the machine re sources used by the various processes of the various parts is not only, and the technical level of workers to operate the machine are very different, so the genetic algorithm considering the sequence, simultaneously, the machine choice and worker choice has been put forward, for reaching the shortest producing period. This method adopts three substrings to encode, combining with the charac teristics of the resources scheduling problem, and designs the unique way of crossover and mutation, meanwhile, it shows that the algorithm is effective through a specific example simulation analysis.

关 键 词：资源调度 遗传算法 交叉算子 变异算子 

分 类 号：TH16[机械工程—机械制造及自动化]