基于DPSO的无等待混合流水车间调度方法  

No-wait Hybrid Flow Shop Scheduling Method Based on Discrete Particle Swarm Optimization

作　　者：宋继伟[1] 唐加福[1] 

机构地区：[1]东北大学流程工业综合自动化教育部重点实验室,沈阳110004

出　　处：《系统仿真学报》2010年第10期2257-2261,共5页Journal of System Simulation

基　　金：国家自然科学基金(70721001;70625001);教育部新世纪优秀人才支持计划(NCET_04_280)

摘　　要：研究了无等待混合流水车间调度问题,调度目标为最小化工件的最大完成时间。针对问题中工件加工无等待特点,设计了分阶段实现的无等待算法,并将机器的能力约束嵌入到算法之中。在此基础上,首次应用离散粒子群优化算法对无等待混合流水车间调度问题进行了优化求解。通过仿真实验表明,离散粒子群算法的优化质量优于遗传算法及LTPT、STPT和FCFP三种启发式算法,同时验证了分阶段无等待算法的有效性。A no-wait hybrid flow shop（NWHFS） scheduling problem was studied for the objective of minimizing makespan.For the no-wait constraint between two sequential operations of a job,not only the no-wait algorithm of grading was designed,but also the number restriction of machines was embedded into this algorithm.On this basis,the discrete particle swarm optimization（DPSO） algorithm was proposed for the first time to solve such problems.The last simulation experiments show the optimization qualities of DPSO are superior to those of the genetic algorithm（GA） and the heuristic algorithms of LTPT,STPT and FCFP,and demonstrate the effectiveness of the no-wait algorithm of grading as well.

关 键 词：无等待 混合流水车间 分阶段无等待算法 离散粒子群优化 遗传算法 

分 类 号：TP278[自动化与计算机技术—检测技术与自动化装置]