A hybrid artificial bee colony algorithm for a flexible job shop scheduling problem with overlapping in operations

被引:91
作者
Meng, Tao [1 ,2 ]
Pan, Quan-Ke [1 ]
Sang, Hong-Yan [3 ]
机构
[1] Shanghai Univ, Sch Mechatron Engn & Automat, Shanghai, Peoples R China
[2] Liaocheng Univ, Coll Math Sci, Liaocheng, Peoples R China
[3] Liaocheng Univ, Sch Comp Sci, Liaocheng, Peoples R China
基金
中国国家自然科学基金;
关键词
flexible job shop; operation overlapping; artificial bee colony; migrating birds optimisation; meta-heuristics; MIGRATING BIRDS OPTIMIZATION; NUMERICAL FUNCTION OPTIMIZATION; PARTICLE SWARM OPTIMIZATION; EFFECTIVE GENETIC ALGORITHM; HARMONY SEARCH ALGORITHM; MAINTENANCE; MINIMIZATION;
D O I
10.1080/00207543.2018.1467575
中图分类号
T [工业技术];
学科分类号
120111 [工业工程];
摘要
Overlapping in operations is an effective technology for productivity improvement in modern manufacturing systems. Thus far, however, there are still rare works on flexible job shop scheduling problems (FJSPs) concerning this strategy. In this paper, we present a hybrid artificial bee colony (hyABC) algorithm to minimise the total flowtime for a FJSP with overlapping in operations. In the proposed hyABC, a dynamic scheme is introduced to fine-tune the search scope adaptively. In view of poor exploitation ability of artificial bee colony algorithm, a modified migrating birds optimisation algorithm (MMBO) is developed and integrated into the search process for better balancing global exploration and local exploitation. In MMBO, a forward share strategy with one-job based crossover is designed to make good use of valuable information from behind solutions. Besides, an improved downward share scheme is adopted to increase diversification of the population, and thus alleviate the premature convergence. Extensive experiments based on benchmark instances with different scales are carried out and comparisons with other recent algorithms identify the effectiveness of the proposed hyABC.
引用
收藏
页码:5278 / 5292
页数:15
相关论文
共 51 条
[1]
[Anonymous], 1996, TECHNICAL REPORT SER
[2]
Bozeka A., INT J PRODUCTION RES
[3]
Brandimarte P., 1993, Annals of Operations Research, V41, P157, DOI 10.1007/BF02023073
[4]
JOB-SHOP SCHEDULING WITH MULTIPURPOSE MACHINES [J].
BRUCKER, P ;
SCHLIE, R .
COMPUTING, 1990, 45 (04) :369-375
[5]
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
[6]
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
[7]
Migrating Birds Optimization: A new metaheuristic approach and its performance on quadratic assignment problem [J].
Duman, Ekrem ;
Uysal, Mitat ;
Alkaya, Ali Fuat .
INFORMATION SCIENCES, 2012, 217 :65-77
[8]
Fantuhan M., 2009, INT C COMP SCI ENG V
[9]
Farughi H., 2011, AUSTR J BASIC APPL S, V5, P526
[10]
Flexible job shop scheduling with overlapping in operations [J].
Fattahi, Parviz ;
Jolai, Fariborz ;
Arkat, Jamal .
APPLIED MATHEMATICAL MODELLING, 2009, 33 (07) :3076-3087