基于和声搜索的阻塞流水车间调度问题的算法优化

Optimization algorithm based on HS to solve blocking flow shop scheduling problems

针对以最大完工时间为目标的阻塞流水车间调度问题,提出了一种通过混合和声搜索改进遗传算法的优化求解算法。构建了阻塞流水车间调度原理图并描述了运算方法;详细论述了混合算法的实施流程和关键问题,并使用NEH方法和局部搜索对混合算法进行了改进。仿真结果表明,改进后的混合算法能显著提高优化阻塞流水车间调度问题的解。

the blocking jobs in the li .-An improved GA scheduling algorithm （IHSGA） base on HS is firstly proposed to solve flow shop scheduling problems（BFSP） with the objective of minimizing the makespan of the terature. The BFSP scheduling principle figure is constructed and the process of operation method is described. The application steps and the key problems of hybrid algorithm are discussed in de- tail and NEH 〉 local search methods are used to improve the hybrid. Simulation results show that IHS- GA algorithms can obtain a better solution than other algorithms.