The flexible job shop scheduling problem (FJSP) is an NP-hard combinatorial optimization problem, which has wide applications in the real world. The complexity and relevance of the FJSP have led to numerous research works on its modeling and resolution. This paper reviews some of the research of the past 30 years on the problem, by presenting and classifying the different criteria, constraints, configurations and solution approaches that have been considered. Recent emerging topics on complex shop scheduling, multi-criteria optimization and uncertain and dynamic environments are discussed. Finally, future research opportunities are proposed.

中文翻译：

---

灵活作业车间调度问题：回顾

柔性作业车间调度问题（FJSP）是一个NP难组合优化问题，在现实世界中有着广泛的应用。FJSP 的复杂性和相关性导致了对其建模和解析的大量研究工作。本文通过对已考虑的不同标准、约束、配置和解决方法进行介绍和分类，回顾了过去 30 年关于该问题的一些研究。讨论了关于复杂车间调度、多标准优化以及不确定和动态环境的最新新兴主题。最后，提出了未来的研究机会。