带工序跳跃的绿色混合流水车间机器与AGV联合调度

针对带工序跳跃的绿色混合流水车间机器和自动引导车(AGV)联合调度问题,提出改进memetic algorithm (MA)以同时最小化最大完工时间和总能耗.首先,设计基于工序、机器和转速的三层编码策略,最大程度保证算法在整个解空间中搜索;然后,设计混合种群初始化方法以提高初始种群解的质量,同时设计交叉和变异算子以及两种基于问题的邻域搜索策略来平衡算法的全局搜索和局部搜索能力;最后,通过大量仿真实验验证MA算法求解该问题的有效性和优越性.

Joint scheduling of machines and AGVs in green hybrid flow shop with missing operations

For the joint scheduling of machines and automated guided vehicles(AGVs) in the green hybrid flow shop problem with missing operations, an improved memetic algorithm(MA) is proposed to minimize both the maximum completion time and the total energy consumption, simultaneously. Firstly, a three-layer encoding method based on operations, machines and speeds is designed to ensure the search of the algorithm in the whole solution space to the greatest extent. Then, a hybrid population initialization method is designed to improve the quality of initial population. Meanwhile, crossovers, mutation operators and two kinds of neighbourhood search strategies based on the problem are designed to balance the global and local search ability of the algorithm. Finally, simulation experiments show the superiority of the proposed algorithm in solving the joint scheduling of machines and AGVs in the green hybrid flow shop problem with missing operations.