摘要
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 numer-ous 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 schedul-ing, multi-criteria optimization and uncertain and dynamic environments are discussed. Finally, future research opportunities are proposed.
学科与关键词
关键词
SchedulingFlexible job shopSurveyCriteriaConstraints
- Survey of integrated flexible job shop scheduling problemsLi, Xixing; Guo, Xing; Tang, Hongtao*; Wu, Rui; Wang, Lei; Pang, Shibao; Liu, Zhengchao; Xu, Wenxiang; Li, XinCOMPUTERS & INDUSTRIAL ENGINEERING, 2022, 174: 108786.被引 39
- A Review on Intelligent Scheduling and Optimization for Flexible Job ShopJiang, Bin*; Ma, Yajie; Chen, Lijun; Huang, Binda; Huang, Yuying; Guan, LiINTERNATIONAL JOURNAL OF CONTROL AUTOMATION AND SYSTEMS, 2023, 21(10): 3127-3150.被引 11
- A review of scheduling problem and resolution methods in flexible flow shopLee, Tian-Soon*; Loong, Ying-TaiInternational Journal of Industrial Engineering Computations, 2019, 10(1): 67-88.被引 55
