期刊
IET COLLABORATIVE INTELLIGENT MANUFACTURING
卷 1, 期 3, 页码 67-77出版社
WILEY
DOI: 10.1049/iet-cim.2018.0009
关键词
optimisation; job shop scheduling; combinatorial mathematics; manufacturing industries; FJSP; flexible job shop scheduling problem; NP-hard combinatorial optimisation problem; meta-heuristics; manufacturing industry
资金
- Natural Science Foundation of China (NSFC) [51825502, 51775216, 51705177]
- Natural Science Foundation of Hubei Province [2018CFA078]
- Program for HUST Academic Frontier Youth Team [2017QYTD04]
Flexible job shop scheduling problem (FJSP) is an NP-hard combinatorial optimisation problem, which has significant applications in the real world. Due to its complexity and significance, lots of attentions have been paid to tackle this problem. In this study, the existing solution methods for the FJSP in recent literature are classified into exact algorithms, heuristics and meta-heuristics, which are reviewed comprehensively. Moreover, the real-world applications of the FJSP are also introduced. Finally, the development trends of the manufacturing industry are analysed, and the future research opportunities of the FJSP are summarised in detail.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据