.png){kind=icon}
返回
A sequence learning harmony search algorithm for the flexible process planning problem
.png){kind=icon}
PRE
AI
DOI：10.1080/00207543.2021.1912432.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Flexible process planning involves selecting and sequencing the requisite operations, and assigning the right machine, tool and access direction to each selected operation for minimising the production cost or the completion time. It is one of the challenging combinatorial optimisation problems due to sequencing flexibility, processing flexibility and operation flexibility. A sequence learning harmony search algorithm is accordingly proposed. Distinctively, the well-designed algorithm searches for the optimal process plan by intelligently finding the proper immediate successor for each selected operation in turn rather than resorting to the common shifting and swapping operators in sequencing. The innovative algorithm does not also require extra efforts to plot the operational precedence graph or the AND/OR-network graph. The experimental results indicate that the proposed algorithm significantly outperforms other heuristics in terms of the quality of solution found and the convergence rate of the algorithm. For the large-scale complicated instances, the proposed algorithm establishes a challenging flag.
Keyword:
Flexible manufacturing systems
computer-aided manufacturing
flexible process planning
harmony search
sequence learning
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.3
论文数:
1.1W
被引数:
3.7W
机构
引用论文
A hybrid harmony search algorithm for the flexible job shop scheduling problem一种求解柔性作业车间调度问题的混合和声搜索算法
.png){kind=icon}
PREAI
分享收藏
分享收藏Modified genetic algorithms for manufacturing process planning in multiple parts manufacturing lines
PREAI
分享收藏
查看更多内容