新型离散蝙蝠算法求解柔性流水车间调度问题

Novel discrete bat algorithm for solving flexible flow shop scheduling problem

针对以最小化完工时间为目标的柔性流水车间调度问题,提出了一种新型离散蝙蝠算法。介绍了蝙蝠算法的基本思想,重新定义速度与位置的加法操作来实现粒子的位移,给出了算法的具体实现方案。通过实例仿真和算法比较验证了算法的优化性能,实验结果表明该算法可以有效地求解柔性流水车间调度问题。

A novel discrete bat algorithm is proposed for solving the Flexible Flow Shop Scheduling Problem（FFSP）with makespan criterion. It redefines the addition operation of the speed and position to achieve the displacement of the particles and gives the specific implementation. The experimental results show that the algorithm has good performance in solving the flexible flow shop scheduling problem, and it is an effective scheduling algorithm.