.png){kind=icon}
返回
An adaptive scheduling algorithm for a parallel machine problem with rework processes
.png){kind=icon}
PRE
AI
DOI：10.1080/00207540802484903.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The development of a scheduling methodology for a parallel machine problem with rework processes is presented in this paper. The problem is to make a schedule for parallel machines with rework probabilities, due-dates, and sequence dependent setup times. Two heuristics are developed based on a dispatching algorithm and problem-space-based search method. In order to evaluate the efficacy of the proposed algorithms, six performance indicators are considered: total tardiness, maximum lateness, mean flow-time, mean lateness, the number of tardy jobs, and the number of reworks. This paper shows how these algorithms can adaptively capture the characteristics of manufacturing facilities for enhancing the performance under changing production environments. Extensive experimental results show that the proposed algorithms give very efficient performance in terms of computational time and each objective value.
Keyword:
adaptive scheduling
problem-space-based search
rework probability
parallel machines
dispatching algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.3
论文数:
1.1W
被引数:
3.7W
机构
引用论文
Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics - Discrete optimization使用高级元启发式离散优化解决具有序列相关设置时间的flowshop调度问题
PREAI
分享收藏
An Industrial Quadrotor UAV Control Method Based on Fuzzy Adaptive Linear Active Disturbance Rejection Control.png)
Electronics
OAAI
ElectronicsIF0
OAAI分享收藏
查看更多内容