Fuzzy distributed two-stage hybrid flow shop scheduling problem with setup time: collaborative variable search

被引:31
作者
Cai, Jingcao [1 ]
Zhou, Rui [1 ]
Lei, Deming [1 ]
机构
[1] Wuhan Univ Technol, Sch Automat, Wuhan 430070, Peoples R China
基金
中国国家自然科学基金;
关键词
collaborative variable search; fuzzy scheduling; distributed scheduling; two-stage hybrid flow shop; sequence-dependent setup times; COMPETITIVE MEMETIC ALGORITHM; MINIMIZING MAKESPAN; GENETIC ALGORITHM; FLOWSHOPS; OPTIMIZATION;
D O I
10.3233/JIFS-191175
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Distributed scheduling has attracted much attention in multiple factories. However, uncertainties are often neglected in the previous works and this neglecting may result in the low value of the obtained schedule. In this study, fuzzy distributed scheduling is addressed in two-stage hybrid flow shop with sequence-dependent setup times(SDST) which is a frequently studied constraint in single factory and seldom handled in multiple factories. A collaborative variable search (CVS) is proposed to optimize total agreement index and fuzzy makespan simultaneously. Seven neighborhood structures and two global search operators are used in two cooperated variable search parts to generate high quality solutions. Experiments are conducted and the computational results reveal that CVS has promising advantages on the considered fuzzy distributed scheduling problem.
引用
收藏
页码:3189 / 3199
页数:11
相关论文
共 51 条
[1]   A review of scheduling research involving setup considerations [J].
Allahverdi, A ;
Gupta, JND ;
Aldowaisan, T .
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 1999, 27 (02) :219-239
[2]   Scheduling two-stage hybrid flow shop with availability constraints [J].
Allaoui, H ;
Artiba, A .
COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (05) :1399-1419
[4]   The heterogeneous multi-factory production network scheduling with adaptive communication policy and parallel machine [J].
Behnamian, J. ;
Ghomi, S. M. T. Fatemi .
INFORMATION SCIENCES, 2013, 219 :181-196
[5]   Order assignment and scheduling in a supply chain [J].
Chen, ZL ;
Pundoor, G .
OPERATIONS RESEARCH, 2006, 54 (03) :555-572
[6]   A competitive memetic algorithm for multi-objective distributed permutation flow shop scheduling problem [J].
Deng, Jin ;
Wang, Ling .
SWARM AND EVOLUTIONARY COMPUTATION, 2017, 32 :121-131
[7]   A competitive memetic algorithm for the distributed two-stage assembly flow-shop scheduling problem [J].
Deng, Jin ;
Wang, Ling ;
Wang, Sheng-yao ;
Zheng, Xiao-long .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2016, 54 (12) :3561-3577
[8]  
Engin O, 2009, STUD COMPUT INTELL, V230, P169
[9]  
Engin O, 2009, J MULT-VALUED LOG S, V15, P107
[10]   Solving the two-stage hybrid flow shop scheduling problem based on mutant firefly algorithm [J].
Fan, Beibei ;
Yang, Wenwei ;
Zhang, Zaifang .
JOURNAL OF AMBIENT INTELLIGENCE AND HUMANIZED COMPUTING, 2019, 10 (03) :979-990