基于最短处理时间疫苗的免疫遗传算法优化FJSP问题  

Optimization of Flexible Job-shop Scheduling Problem by Immune Genetic Algorithm of Shortest Processing Time Vaccine

作　　者：信宁宁[1] 黄宗南[1] 

机构地区：[1]上海大学机电工程与自动化学院,上海200072

出　　处：《机械设计与研究》2013年第3期53-55,共3页Machine Design And Research

摘　　要：合理的作业调度方案能提高加工机器的利用率。针对柔性作业车间调度求解难度更大的特点,采用免疫遗传算法求解。在疫苗技术方面,提出依据工件工序加工时间表,选择同工件同工序加工时间最短的机器作为疫苗,对相应工件个体机器码接种。最后对测试案例求解,结果表明所采取的方法能够求得更好的调度方案,减少机器空闲时间。Reasonable job scheduling program can improve the utilization of the processing machine. The immune genetic algorithm is used to solve the flexible job-shop scheduling problem while it is more difficult. At the side of vac- cine technology, according to the process timetable of the work piece, selecting the machine that processes the same process of same work piece with the shortest processing time as vaccine is proposed and vaccinate the machine code of the individual for the corresponding workpiece. Finally, an example is tested, the result shows that the method used can obtain better scheduling program and reduce machine idle time.

关 键 词：柔性作业车间调度 免疫遗传算法 最短处理时间 疫苗 

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