柔性作业车间调度问题是一个NP难组合优化问题，在车间调度和智能制造领域有着重要的应用。由于其复杂性和重要性，解决这个问题引起了很多关注。本文通过介绍和分类不同的标准、约束和解决方法，回顾了有关该问题的一些研究。该文献中针对柔性作业车间调度问题的现有求解方法分为精确算法、启发式和元启发式，并进行了深入的回顾。本文特别强调了动态事件和预防性维护背景下的灵活作业车间调度问题。这些动态事件，例如机器故障和工作要求的意外变化，给调度问题带来了额外的挑战。此外，本文分析了制造业的发展趋势，并总结了柔性作业车间调度问题的详细未来研究机会。

"点击查看英文标题和摘要"

Flexible job shop scheduling problem is a NP-hard combinatorial optimization problem, which has significant applications in the field of workshop scheduling and intelligent manufacturing. Due to its complexity and significance, lots of attention have been paid to tackle this problem. This paper reviews some of the researches on this problem, by presenting and classifying the different criteria, constraints, and solution approaches. The existing solution methods for the flexible job shop scheduling problem in this literature are classified into exact algorithms, heuristics, and meta-heuristics, which are thoroughly reviewed. Particularly, the paper highlights the flexible job shop scheduling problem in the context of dynamic events and preventive maintenance. These dynamic events, such as machine breakdowns and unexpected changes in job requirements, present additional challenges to the scheduling problem. Furthermore, this paper analyzes the development trends in the manufacturing industry and summarizes detailed future research opportunities for the flexible job shop scheduling problem.