A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility

被引:104
作者
Yu, Chunlong [1 ]
Semeraro, Quirico [1 ]
Matta, Andrea [1 ]
机构
[1] Politecn Milan, Dipartimento Meccan, Milan, Italy
关键词
Scheduling; Hybrid flow shop; Genetic algorithm; SEQUENCE-DEPENDENT SETUP; PARALLEL MACHINES; TOTAL TARDINESS; SEARCH ALGORITHM; TIMES; FLOWSHOPS; SYSTEM; OPTIMIZATION; CONSTRAINTS; INDUSTRY;
D O I
10.1016/j.cor.2018.07.025
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
This paper presents a genetic algorithm to solve the hybrid flow shop scheduling problem to minimize the total tardiness. Practical assumptions as unrelated machines and machine eligibility are considered. The proposed algorithm incorporates a new decoding method developed for total tardiness objective, which is able to obtain tight schedule meanwhile guarantee the influence of the chromosome on the schedule. The proposed algorithm has been calibrated with a full factorial design of experiment, and compared to several calibrated state-of-art algorithms on 450 instances with different size and correlation patterns of operation processing time. The results validate the effectiveness of the proposed algorithm. (C) 2018 Elsevier Ltd. All rights reserved.
引用
收藏
页码:211 / 229
页数:19
相关论文
共 50 条
[1]   BPSS - A SCHEDULING SUPPORT SYSTEM FOR THE PACKAGING INDUSTRY [J].
ADLER, L ;
FRAIMAN, N ;
KOBACKER, E ;
PINEDO, M ;
PLOTNICOFF, JC ;
WU, TP .
OPERATIONS RESEARCH, 1993, 41 (04) :641-648
[2]   Workload simulation and optimisation in multi-criteria hybrid flowshop scheduling: a case study [J].
Alfieri, A. .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2009, 47 (18) :5129-5145
[3]  
[Anonymous], 1996, MATH INTELL
[4]  
[Anonymous], INT J PROD ECON
[5]  
[Anonymous], J INTELLIGENT MANUFA
[6]   Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness [J].
Botta-Genoulaz, V .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2000, 64 (1-3) :101-111
[7]   Bottleneck-based heuristics to minimize total tardiness for the flexible flow line with unrelated parallel machines [J].
Chen, Chun-Lung ;
Chen, Chuen-Lung .
COMPUTERS & INDUSTRIAL ENGINEERING, 2009, 56 (04) :1393-1401
[8]   A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal [J].
Chen, Lu ;
Bostel, Nathalie ;
Dejax, Pierre ;
Cai, Jianguo ;
Xi, Lifeng .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 181 (01) :40-58
[9]   Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop [J].
Choi, SW ;
Kim, YD ;
Lee, GC .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2005, 43 (11) :2149-2167
[10]   An improved discrete artificial bee colony algorithm to minimize the makespan on hybrid flow shop problems [J].
Cui, Zhe ;
Gu, Xingsheng .
NEUROCOMPUTING, 2015, 148 :248-259