.png){kind=icon}
返回
A hybrid genetic algorithm for distributed hybrid blocking flowshop scheduling problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jmsy.2023.09.017.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper addresses a distributed hybrid blocking flowshop scheduling problem (DHBFSP) with makespan criterion. Based on the distributed hybrid flowshop scheduling problem (DHFSP) and blocking constraints, a mathematical model of mixed integer linear programming for the DHBFSP is proposed, and a hybrid genetic algorithm is developed. Eight new heuristics are defined in the process of population initialization according to the blocking characteristics of the problem, and five heuristic rules are chosen through experiments for population initialization and the rest of the individuals are generated randomly. Offspring individuals are obtained through crossover and mutation operations, while an offspring selection strategy is proposed to make decisions in the population offspring selection. The destruction and reconstruction (DR) operation is performed for the optimal individuals of the offspring population to optimize their individual structures, and a local search method is adopted for the deep search of individuals. Compared with other existing meta-heuristics, the proposed hybrid genetic algorithm performs better on benchmarks and the local search method VND_LS3 has a comprehensively strong search capability.
Keyword:
Distributed hybrid blocking flowshop
scheduling
Genetic algorithm
Iterated greedy algorithm
Heuristics
期刊
IF:
14.2
论文数:
2.7K
被引数:
1.6W
机构
引用论文
Minimizing Makespan in Distributed Blocking Flowshops Using Hybrid Iterated Greedy Algorithms使用混合迭代贪婪算法最小化分布式阻塞流水车间中的制造时间.png)
IEEE ACCESS
OAAI
IEEE ACCESSIF3.6
OAAI分享收藏分享收藏
查看更多内容