A hybrid multi-objective evolutionary algorithm for solving an adaptive flexible job-shop rescheduling problem with real-time order acceptance and condition-based preventive maintenance

被引:67
作者
An, Youjun [1 ]
Chen, Xiaohui [1 ]
Gao, Kaizhou [2 ,3 ,4 ]
Zhang, Lin [1 ]
Li, Yinghe [1 ]
Zhao, Ziye [1 ]
机构
[1] Chongqing Univ, State Key Lab Mech Transmiss, Chongqing 400030, Peoples R China
[2] Macau Univ Sci & Technol, Macau Inst Syst Engn, Macau 999078, Peoples R China
[3] Macau Univ Sci & Technol, Collaborat Lab Intelligent Sci & Syst, Macau 999078, Peoples R China
[4] Liaocheng Univ, Sch Comp Sci, Liaocheng 252000, Peoples R China
基金
中国国家自然科学基金; 国家重点研发计划;
关键词
Hybrid multi-objective evolutionary algorithm; Adaptive flexible job-shop rescheduling; problem; Real-time order acceptance; Condition-based preventive maintenance; BEE COLONY ALGORITHM; GENETIC ALGORITHM; FLOW-SHOP; SCHEDULING PROBLEM; SEARCH ALGORITHM; PREDICTIVE-MAINTENANCE; NEIGHBORHOOD-STRUCTURE; SYSTEMS SUBJECT; SINGLE-MACHINE; TABU SEARCH;
D O I
10.1016/j.eswa.2022.118711
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Production scheduling and maintenance planning are two of the most important tasks in the modern manufac-turing workshop. Meanwhile, due to the dynamic order arrival and real-time machine monitoring information updating, the integrated optimization of them becoming more complex and meaningful. Therefore, this study intends to address an adaptive flexible job-shop rescheduling problem with real-time order acceptance (ROA) and condition-based preventive maintenance (CBPM). More precisely, the main innovative works are described as follows: (1) a CBPM policy with both imperfect preventive maintenance (PM) and four inspection strategies is designed to find the optimal maintenance planning for each production machine; (2) a multi-objective optimization model is developed for the concerned problem; and (3) a hybrid multi-objective evolutionary algorithm (HMOEA) with hybrid initialization method, hybrid local search operators and adaptive rescheduling strategies is proposed. In the numerical simulation, the performance and competitiveness of the proposed CBPM policy are first demonstrated by comparing with other maintenance policies. Second, the effectiveness and superiority of parameter setting, order sorting rules, improved operators and overall performance of the proposed algorithm are verified by internal analysis of the algorithm. Third, an adaptive rescheduling strategy pool is constructed by running three rescheduling strategies on all rescheduling scenarios. Finally, a comprehensive sensitivity analysis is performed to illustrate the impact of several critical parameters on the adaptive rescheduling problem, and the results and comparisons show that the proposed HMOEA algorithm and order acceptance strategy have good robustness in most parameters.
引用
收藏
页数:23
相关论文
共 115 条
[111]   A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem [J].
Zhang, ChaoYong ;
Li, PeiGen ;
Guan, ZaiLin ;
Rao, YunQing .
COMPUTERS & OPERATIONS RESEARCH, 2007, 34 (11) :3229-3242
[112]   Integrated optimization of train scheduling and maintenance planning on high-speed railway corridors [J].
Zhang, Chuntian ;
Gao, Yuan ;
Yang, Lixing ;
Kumar, Uday ;
Gao, Ziyou .
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2019, 87 :86-104
[113]   An effective genetic algorithm for the flexible job-shop scheduling problem [J].
Zhang, Guohui ;
Gao, Liang ;
Shi, Yang .
EXPERT SYSTEMS WITH APPLICATIONS, 2011, 38 (04) :3563-3573
[114]   MOEA/D: A multiobjective evolutionary algorithm based on decomposition [J].
Zhang, Qingfu ;
Li, Hui .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2007, 11 (06) :712-731
[115]   Order acceptance and scheduling with machine availability constraints [J].
Zhong, Xueling ;
Ou, Jinwen ;
Wang, Guoqing .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 232 (03) :435-441