中文摘要：

柔性作业车间调度问题（FJSP）一直是生产调度领域和组合优化领域的研究重点,为获得更加理想的FJSP解,解决标准人工免疫算法易陷入局部极值等不足,本文提出一种求解FJSP的改进人工免疫算法（AIA）,该算法引入模拟退算法的Metropolis准则,接受新抗体,保证种群的多样性,加快搜索效率,并采用标准算例对其性能进行对比分析.仿真结果表明,改进人工免疫算法提高了FJSP的求解效率和解的质量,具有较高的实际应用价值.

英文摘要：

Flexible job shop scheduling problem （FJSP） has been the focus of research in production sched-uling and combinatorial optimization, and the standard artificial immune algorithm is easy to fall into local extreme problems. In order to obtain a more ideal FJSP solution, this paper proposes an artificial immune algorithm improved to solve FJSP. Metropolis criterion of simulated annealing algorithm is introduced to artificial immune algorithm to accept the new antibody and ensure the diversity of the population to speed up the search efficiency. Finally, the performance is tested by simulation comparative analysis. The simu-lation results show that the proposed algorithm has improved the FJSP solving efficiency and solution qual-ity, so it has a high practical application value.