.png){kind=icon}
返回
Time-selective integrated scheduling algorithm with backtracking adaptation strategy
.png){kind=icon}
PRE
AI
DOI：10.1111/exsy.12305.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Currently, integrated scheduling algorithms schedule processes using fixed rules, making it difficult to balance serial and parallel processes in product craftsmanship trees while conducting complicated single product scheduling. To solve this problem, we propose a time-selective integrated scheduling algorithm with a backtracking adaptation (TISAWBA) strategy. The proposed process sequence sorting strategy aims to determine process scheduling sequences based on the overall structure of the machining craftsmanship tree. The proposed time-selective scheduling strategy aims to select the process portfolio with the minimum total elapsed time for machining from a process portfolio set based on craftsmanship tree structure. The proposed backtracking adaptation strategy conducts backtracking adaptation to find process portfolios having a total elapsed machining time greater than the scheduling reference time. Finally, illustrative use cases verify that TISAWBA guarantees parallel processing for parallel processes and elevates the proximity of serial processes, generating optimized integrated scheduling results.
Keyword:
backtracking adaptation
integrated scheduling
scheduling reference time
time-selective
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.3
论文数:
2.5K
被引数:
3.8K
机构
引用论文
Intermediate reverse osmosis ultrafiltration (RO UF) membranes for concentration and desalting of low molecular weight organic solutes.png)
Desalination
DesalinationIF0
PREAI
分享收藏Optimizing the production scheduling of a single machine to minimize total energy consumption costs
PREAI
分享收藏分享收藏 没有更多内容
没有更多内容