NSGA-III for solving dynamic flexible job shop scheduling problem considering deterioration effect

被引:18
作者
Wu, Xiuli [1 ]
Li, Jing [1 ]
Shen, Xianli [1 ]
Zhao, Ning [1 ]
机构
[1] Univ Sci & Technol Beijing, Sch Mech Engn, Dept Logist Engn, Beijing, Peoples R China
基金
中国国家自然科学基金;
关键词
genetic algorithms; Pareto optimisation; computational complexity; manufacturing systems; job shop scheduling; optimisation; scheduling; sorting; energy consumption; stability criteria; Pareto solution; nondominated sorting genetic algorithm III; NP-hard problem; stability; makespan; multiobjective optimisation; processing time prediction; unqualified jobs reprocessing; explicit disturbance; implicit disturbance; DF[!text type='JS']JS[!/text]P-DE; stochastic events; NSGA-III; dynamic job shop scheduling; step-deterioration effect model; ALGORITHM; MAINTENANCE; MAKESPAN;
D O I
10.1049/iet-cim.2019.0056
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
The production process of manufacturing systems is usually not static and always interrupted by stochastic events, such as the deterioration effect of cutting tools. This study focuses on the dynamic flexible job shop-scheduling problem considering the deterioration effect (DFJSP-DE). Two types of disturbances are considered, i.e. the implicit disturbance caused by the deterioration effect and the explicit disturbance caused by the reprocessing of unqualified jobs. Firstly, a step-deterioration effect model is proposed, with which the actual processing time of each operation can be predicted more accurately. A multi-objective optimisation model is formulated for the DFJSP-DE. The makespan, energy consumption, and stability of rescheduling solutions are three objectives to be optimised simultaneously. For this non-deterministic polynominal (NP)-hard problem, the non-dominated sorting genetic algorithm III is employed to search the Pareto solutions for the DFJSP-DE. Finally, the results of three numerical experiments show that the proposed approach can solve DFJSP-DE effectively and efficiently.
引用
收藏
页码:22 / 33
页数:12
相关论文
共 25 条
[1]   Multi-objective scheduling of dynamic job shop using variable neighborhood search [J].
Adibi, M. A. ;
Zandieh, M. ;
Amiri, M. .
EXPERT SYSTEMS WITH APPLICATIONS, 2010, 37 (01) :282-287
[2]  
Brandimarte P., 1993, Annals of Operations Research, V41, P157, DOI 10.1007/BF02023073
[3]   A proactive approach to solve integrated production scheduling and maintenance planning problem in flow shops [J].
Cui, Weiwei ;
Lu, Zhiqiang ;
Li, Chen ;
Han, Xiaole .
COMPUTERS & INDUSTRIAL ENGINEERING, 2018, 115 :342-353
[4]   An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints [J].
Deb, Kalyanmoy ;
Jain, Himanshu .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2014, 18 (04) :577-601
[5]   ONLINE MINIMUM MAKESPAN SCHEDULING WITH A BUFFER [J].
Ding, Ning ;
Lan, Yan ;
Chen, Xin ;
Dosa, Gyoergy ;
Guo, He ;
Han, Xin .
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2014, 25 (05) :525-536
[6]   A two-stage artificial bee colony algorithm scheduling flexible job-shop scheduling problem with new job insertion [J].
Gao, Kai Zhou ;
Suganthan, Ponnuthurai Nagaratnam ;
Chua, Tay Jin ;
Chong, Chin Soon ;
Cai, Tian Xiang ;
Pan, Qan Ke .
EXPERT SYSTEMS WITH APPLICATIONS, 2015, 42 (21) :7652-7663
[7]   A review of energy-efficient scheduling in intelligent production systems [J].
Gao, Kaizhou ;
Huang, Yun ;
Sadollah, Ali ;
Wang, Ling .
COMPLEX & INTELLIGENT SYSTEMS, 2020, 6 (02) :237-249
[8]   Flexible Job-Shop Rescheduling for New Job Insertion by Using Discrete Jaya Algorithm [J].
Gao, Kaizhou ;
Yang, Fajun ;
Zhou, MengChu ;
Pan, Quanke ;
Suganthan, Ponnuthurai Nagaratnam .
IEEE TRANSACTIONS ON CYBERNETICS, 2019, 49 (05) :1944-1955
[9]  
Hopf M., 2017, EUR J OPER RES, V7, P2007
[10]   Hybrid genetic algorithms for minimizing makespan in dynamic job shop scheduling problem [J].
Kundakci, Nilsen ;
Kulak, Osman .
COMPUTERS & INDUSTRIAL ENGINEERING, 2016, 96 :31-51