arrow
返回

Flexible integrated scheduling algorithm based on remaining work probability selection coding

delete2021-02-28
delete8
PRE
AI
Y
Yilong Gao
Z
Zhiqiang Xie *
D
Dan Yang
X
Xu Yu
DOI:10.1111/exsy.12683delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Aiming at the integrated scheduling problem of tree-structured products with flexible machine selection, this article proposes a flexible integrated scheduling algorithm based on remaining work probability selection coding. The algorithm is based on the framework of a genetic algorithm. First, in order to ensure the diversity and goodness of the initial population, an encoding method based on remaining work probability selection is proposed. Second, two new different crossover and mutation methods are designed based on operation and position respectively, which ensure the legitimacy of the generated offspring individuals. Then, in order to enhance the searchability of the algorithm for an optimal solution of the problem, a local search strategy based on the machine is proposed. Finally, a simple and effective decoding method based on the idle period is given. The algorithm is tested by the existing instance and randomly generated instances. The experimental results show that the proposed algorithm's solving speed and solution quality outperform other comparison algorithms.
Keyword:
flexible machine
genetic algorithm
integrated scheduling algorithm
processing and assembly
tree‐ structured products
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Expert Systems 封面图
Expert Systems
IF:
2.3
论文数:
2.6K
被引数:
3.8K

机构

暂无机构信息
引用论文

引用论文

Flexible Job-Shop Rescheduling for New Job Insertion by Using Discrete Jaya Algorithm
err2019-05-01
err236
errOAAI
errGao, Kaizhou; Yang, Fajun; Zhou, MengChu; Pan, Quanke; Suganthan, Ponnuthurai Nagaratnam
err分享
err收藏
err分享
err收藏
学者 查看更多内容