返回
Flexible integrated scheduling algorithm based on remaining work probability selection coding
DOI:10.1111/exsy.12683.png)
摘要
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总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.3
论文数:
2.6K
被引数:
3.8K
机构
暂无机构信息
引用论文
Time-selective integrated scheduling algorithm with backtracking adaptation strategy具有回溯自适应策略的时间选择性综合调度算法
EXPERT SYSTEMS
IF2.3
A hybrid genetic algorithm for minimizing makespan in a flow-shop sequence-dependent group scheduling problem一种混合遗传算法,用于在依赖于流水车间序列的组调度问题中最小化makespan
A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility具有无关机器和机器资格的混合流水车间调度的遗传算法
Comparison of recent optimization algorithms for design optimization of a cam-follower mechanism凸轮从动件机构设计优化的最新优化算法比较

