In the practical production, the transportation of jobs is existed between different machines. These transportation operations directly affect the production cycle and the production efficiency. In this study, an improved memetic algorithm is proposed to solve the flexible job shop scheduling problem with transportation times, and the optimization objective is minimizing the makespan. In the improved memetic algorithm, an effective simulated annealing algorithm is adopted in the local search process, which combines the elite library and mutation operation. All the feasible solutions are divided into general solutions and local optimal solutions according to the elite library. The general solutions are executed by the simulated annealing algorithm to improve the quality, and the local optimal solutions are executed by the mutation operation to increase the diversity of the solution set. Comparison experiments with the improved genetic algorithm show that the improved memetic algorithm has better search performance and stability.

中文翻译：

---

具有运输时间的柔性作业车间调度问题的改进模因算法

在实际生产中，不同机器之间存在着作业的输送。这些运输作业直接影响生产周期和生产效率。在这项研究中，提出了一种改进的模因算法来解决具有运输时间的柔性作业车间调度问题，优化目标是最小化完工时间。改进的模因算法在局部搜索过程中采用了一种有效的模拟退火算法，结合了精英库和变异操作。所有可行解根据精英库分为通用解和局部最优解。通用解决方案由模拟退火算法执行以提高质量，并通过变异操作执行局部最优解，以增加解集的多样性。与改进遗传算法的对比实验表明，改进的模因算法具有更好的搜索性能和稳定性。