针对柔性流水车间调度问题,利用机器特定事件点来描述工件的机器选择,再以最小化最大完工为目标,考虑工艺约束和时间约束构建了柔性流水车间调度的混合整数线性规划模型,用GAMS/Cplex找到小规模问题的全局最优解。为快速求解大规模问题的近优解,提出了结合瓶颈启发式的引力搜索算法,利用瓶颈移动技术和John Son方法的解码机制,寻找最小化最大完工时间的最优调度方案。实验结果表明,所提出的模型及算法能高效地求解以最小化最大完工时间为目标的柔性流水车间调度问题。
For the flexible flowshop scheduling problem, the machine selection of artifacts is described by specific events on machine. The mixed integer line programming model of flexible flowshop scheduling is built to minimize the maximum completion time considering the process and time constraints. The globally optimal solution of the small scale problem is obtained by GAMS/Cplex. The bottleneck heuristic and the special decoding mechanism are integrated into the gravitational search algorithm so as to solve large-scale problems quickly and find the optimal scheduling scheme. The special decoding mechanism is designed based on the mobile bottleneck technology and JohnSon method. Experimental results show that the model and algorithm can effectively solve the flexible flowshop scheduling with the objective of minimizing the maximum completion time.