Jaya Algorithm for Rescheduling Flexible Job Shop Problem with Machine Recovery

被引：0
作者：
Gao, K. Z. [1 ,2 ]
Zhou, M. C. [3 ]
Pan, Y. X. [1 ,2 ,4 ]
机构：
[1] Macau Univ Sci & Technol, Macau Inst Syst Engn, Taipa 999078, Macao, Peoples R China
[2] Liaocheng Univ, Sch Comp, Liaocheng 252000, Shandong, Peoples R China
[3] New Jersey Inst Technol, Dept Elect & Comp Engn, Newark, NJ 07102 USA
[4] Univ Sanya, Sch Informat & Intelligence Engn, Sanya, Peoples R China
来源：
2019 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS (SMC) | 2019年
基金：
中国国家自然科学基金;
关键词：
SCHEDULING PROBLEM; OPTIMIZATION; SYSTEM; BREAKDOWN; DESIGN; MODEL;
D O I：
暂无
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
This work addresses on flexible job shop rescheduling problem with machine recovery. The goal is to minimize the maximum machine workload and instability simultaneously. As an almost parameter-free metaheuristic, Jaya is used and developed to solve it. A local search operator and an initializing rule are developed for improving Jaya's performance. Ten cases from a remanufacturing company are solved to verify the proposed Jaya's performance. The comparisons and discussions show the effectiveness of the proposed Jaya for rescheduling flexible job shop with machine recovery.
引用
收藏
页码：3660 / 3664
页数：5
相关论文
共 37 条
[1]   A multi objective optimization approach for flexible job shop scheduling problem under random machine breakdown by evolutionary algorithms [J].
Ahmadi, Ehsan ;
Zandieh, Mostafa ;
Farrokh, Mojtaba ;
Emami, Seyed Mohammad .
COMPUTERS & OPERATIONS RESEARCH, 2016, 73 :56-66
[2]   Robust and stable flexible job shop scheduling with random machine breakdowns using a hybrid genetic algorithm [J].
Al-Hinai, Nasr ;
ElMekkawy, T. Y. .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2011, 132 (02) :279-291
[3]   Linguistic-based meta-heuristic optimization model for flexible job shop scheduling [J].
Baykasoglu, A .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2002, 40 (17) :4523-4543
[4]   Sizing, layout and topology design optimization of truss structures using the Jaya algorithm [J].
Degertekin, S. O. ;
Lamberti, L. ;
Ugur, I. B. .
APPLIED SOFT COMPUTING, 2018, 70 :903-928
[5]   Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling [J].
Gao, K. Z. ;
Suganthan, P. N. ;
Pan, Q. K. ;
Chua, T. J. ;
Cai, T. X. ;
Chong, C. S. .
INFORMATION SCIENCES, 2014, 289 :76-90
[6]   A Review on Swarm Intelligence and Evolutionary Algorithms for Solving Flexible Job Shop Scheduling Problems [J].
Gao, Kaizhou ;
Cao, Zhiguang ;
Zhang, Le ;
Chen, Zhenghua ;
Han, Yuyan ;
Pan, Quanke .
IEEE-CAA JOURNAL OF AUTOMATICA SINICA, 2019, 6 (04) :904-916
[7]   Meta-Heuristics for Bi-Objective Urban Traffic Light Scheduling Problems [J].
Gao, Kaizhou ;
Zhang, Yi ;
Zhang, Yicheng ;
Su, Rong ;
Suganthan, Ponnuthurai Nagaratnam .
IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2019, 20 (07) :2618-2629
[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]   A new heuristic optimization algorithm: Harmony search [J].
Geem, ZW ;
Kim, JH ;
Loganathan, GV .
SIMULATION, 2001, 76 (02) :60-68
[10]   Scheduling flexible job shop problem subject to machine breakdown with route changing and right-shift strategies [J].
He, Wei ;
Sun, Di-hua .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2013, 66 (1-4) :501-514
1234