.png){kind=icon}
返回
A competitive memetic algorithm for the distributed two-stage assembly flow-shop scheduling problem
.png){kind=icon}
PRE
AI
DOI：10.1080/00207543.2015.1084063.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This article addresses the distributed two-stage assembly flow-shop scheduling problem (DTSAFSP) with makespan minimisation criterion. A mixed integer linear programming model is presented, and a competitive memetic algorithm (CMA) is proposed. When designing the CMA, a simple encoding scheme is proposed to represent the factory assignment and the job processing sequence; and a ring-based neighbourhood structure is designed for competition and information sharing. Moreover, some knowledge-based local search operators are developed to enhance the exploitation ability. The influence of parameter setting on the CMA is investigated using the analysis of variance method. Extensive computational tests and comparisons are carried out, which demonstrate the effectiveness of the proposed CMA in solving the DTSAFSP.
Keyword:
distributed two-stage assembly flow-shop scheduling
memetic algorithm
makespan
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.3
论文数:
1.1W
被引数:
3.7W
机构
引用论文
.png){kind=icon}
分享收藏Application of genetic algorithms with dominant genes in a distributed scheduling problem in flexible manufacturing systems带显性基因的遗传算法在柔性制造系统分布式调度问题中的应用
PREAI
分享收藏分享收藏A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks
PREAI
分享收藏
查看更多内容