Multi-objective flexible job shop scheduling problem using differential evolution algorithm

被引：0
作者：
Cao, Yang [1 ,2 ,3 ,4 ,5 ]
Shi, Haibo [2 ,3 ,4 ]
Han, Zhonghua [2 ,3 ,4 ,5 ]
机构：
[1] Northeastern Univ, Coll Informat Sci & Engn, CO-110819 Shenyang, Liaoning, Peoples R China
[2] Chinese Acad Sci, Dept Digital Factory, Shenyang Inst Automat, CO-110016 Shenyang, Liaoning, Peoples R China
[3] Univ Chinese Acad Sci, CO-100049 Beijing, Peoples R China
[4] Chinese Acad Sci, Key Lab Networked Control, CO-110016 Shenyang, Liaoning, Peoples R China
[5] Shenyang Jianzhu Univ, Fac Informat & Control Engn, CO-110168 Shenyang, Liaoning, Peoples R China
来源：
2017 9TH INTERNATIONAL CONFERENCE ON MODELLING, IDENTIFICATION AND CONTROL (ICMIC 2017) | 2017年
关键词：
flexible job shop scheduling problem; differential evolution algorithm; multi-objective optimization; OPTIMIZATION;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Flexible job shop scheduling problem (FJSP) is very complex to be controlled, and it is a problem which inherits job shop scheduling problem (JSP) characteristics. FJSP has two sub-problems: routing sub-problem and scheduling sub-problem. In this paper, improved differential evolution (DE) algorithm is presented for multi-objective FJSP. Minimization of three objective functions includes maximum completion time, workload of the most loaded machine and total workload of all machines. The improved algorithm has a well-designed mutation and crossover operator, and uses a Pareto non-dominated sorting method. Computational simulations and comparisons demonstrate the effectiveness of the proposed improved DE algorithm.
引用
收藏
页码：521 / 526
页数：6
相关论文
共 18 条
[1]   A research survey: review of AI solution strategies of job shop scheduling problem [J].
Calis, Banu ;
Bulkan, Serol .
JOURNAL OF INTELLIGENT MANUFACTURING, 2015, 26 (05) :961-973
[2]   Flexible job-shop scheduling problem under resource constraints [J].
Chan, F. T. S. ;
Wong, T. C. ;
Chan, L. Y. .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2006, 44 (11) :2071-2089
[3]   A research survey: review of flexible job shop scheduling techniques [J].
Chaudhry, Imran Ali ;
Khan, Abid Ali .
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2016, 23 (03) :551-591
[4]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197
[5]   ALGORITHMS FOR SOLVING PRODUCTION-SCHEDULING PROBLEMS [J].
GIFFLER, B ;
THOMPSON, GL .
OPERATIONS RESEARCH, 1960, 8 (04) :487-503
[6]   Enhanced Differential Evolution With Adaptive Strategies for Numerical Optimization [J].
Gong, Wenyin ;
Cai, Zhihua ;
Ling, Charles X. ;
Li, Hui .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2011, 41 (02) :397-413
[7]   Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic [J].
Kacem, I ;
Hammadi, S ;
Borne, P .
MATHEMATICS AND COMPUTERS IN SIMULATION, 2002, 60 (3-5) :245-276
[8]   An object-oriented approach for multi-objective flexible job-shop scheduling problem [J].
Kaplanoglu, Vahit .
EXPERT SYSTEMS WITH APPLICATIONS, 2016, 45 :71-84
[9]   Pareto-based discrete artificial bee colony algorithm for multi-objective flexible job shop scheduling problems [J].
Li, Jun-Qing ;
Pan, Quan-Ke ;
Gao, Kai-Zhou .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2011, 55 (9-12) :1159-1169
[10]   An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems [J].
Li, Junqing ;
Pan, Quanke ;
Xie, Shengxian .
APPLIED MATHEMATICS AND COMPUTATION, 2012, 218 (18) :9353-9371
12