An effective discrete harmony search algorithm for flexible job shop scheduling problem with fuzzy processing time

被引：90
作者：
Gao, Kai Zhou [1 ,2 ]
Suganthan, Ponnuthurai Nagaratnam [1 ]
Pan, Quan Ke [2 ]
Tasgetiren, Mehmet Fatih [3 ]
机构：
[1] Nanyang Technol Univ, Sch Elect & Elect Engn, Singapore 639798, Singapore
[2] Liaocheng Univ, Sch Comp, Liaocheng, Peoples R China
[3] Yasar Univ, Dept Ind Engn, Izmir, Turkey
来源：
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH | 2015年 / 53卷 / 19期
基金：
美国国家科学基金会;
关键词：
discrete harmony search; flexible job shop scheduling; fuzzy processing time; fuzzy completion time; remanufacturing; GENETIC ALGORITHM; OPTIMIZATION ALGORITHM; FLOW-SHOP; COLONY;
D O I：
10.1080/00207543.2015.1020174
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
This study addresses flexible job shop scheduling problem (FJSP) with fuzzy processing time. The fuzzy or uncertainty of processing time is one of seven characteristics in remanufacturing. A discrete harmony search (DHS) algorithm is proposed for FJSP with fuzzy processing time. The objective is to minimise maximum fuzzy completion time. A simple and effective heuristic rule is proposed to initialise harmony population. Extensive computational experiments are carried out using five benchmark cases with eight instances from remanufacturing. The proposed heuristic rule is evaluated using five benchmark cases. The proposed DHS algorithm is compared to six metaheuristics. The results and comparisons show the effectiveness and efficiency of DHS for solving FJSP with fuzzy processing time.
引用
收藏
页码：5896 / 5911
页数：16
相关论文
共 35 条
[1]  
Brandimarte P., 1993, Annals of Operations Research, V41, P157, DOI 10.1007/BF02023073
[2]   JOB-SHOP SCHEDULING WITH MULTIPURPOSE MACHINES [J].
BRUCKER, P ;
SCHLIE, R .
COMPUTING, 1990, 45 (04) :369-375
[3]   An effective genetic algorithm for flexible job-shop scheduling with overlapping in operations [J].
Demir, Yunus ;
Isleyen, Selcuk Kursat .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2014, 52 (13) :3905-3921
[4]   A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems [J].
Gao, Jie ;
Sun, Linyan ;
Gen, Mitsuo .
COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (09) :2892-2907
[5]   Discrete harmony search algorithm for flexible job shop scheduling problem with multiple objectives [J].
Gao, K. Z. ;
Suganthan, P. N. ;
Pan, Q. K. ;
Chua, T. J. ;
Cai, T. X. ;
Chong, C. S. .
JOURNAL OF INTELLIGENT MANUFACTURING, 2016, 27 (02) :363-374
[6]   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
[7]   A HYBRID HARMONY SEARCH ALGORITHM FOR THE NO-WAIT FLOW-SHOP SCHEDULING PROBLEMS [J].
Gao, Kai-Zhou ;
Pan, Quan-Ke ;
Li, Jun-Qing ;
Wang, Yu-Ting ;
Liang, Jing .
ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2012, 29 (02)
[8]   Discrete harmony search algorithm for the no-wait flow shop scheduling problem with total flow time criterion [J].
Gao, Kai-zhou ;
Pan, Quan-ke ;
Li, Jun-qing .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2011, 56 (5-8) :683-692
[9]   Optimal cost design of water distribution networks using harmony search [J].
Geem, ZW .
ENGINEERING OPTIMIZATION, 2006, 38 (03) :259-280
[10]   A new heuristic optimization algorithm: Harmony search [J].
Geem, ZW ;
Kim, JH ;
Loganathan, GV .
SIMULATION, 2001, 76 (02) :60-68
1234