.png){kind=icon}
返回
A rework-based dispatching algorithm for module process in TFT-LCD manufacture
.png){kind=icon}
PRE
AI
DOI：10.1080/00207540802471264.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents development of a scheduling methodology for module processing in thin film transistor liquid crystal display (TFT-LCD) manufacturing. The problem is a parallel machine scheduling problem with rework probabilities, sequence-dependent setup times and due dates. It is assumed that rework probability for each job on a machine can be given through historical data acquisition. The dispatching algorithm named GRPD (greedy rework probability with due-dates) is proposed in this paper focusing on the rework processes. The performance of GRPD is measured by the six diagnostic indicators. A large number of test problems are randomly generated to evaluate the performance of the proposed algorithm. Computational results show that the proposed algorithm is significantly superior to existing dispatching algorithms for the test problems.
Keyword:
TFT-LCD manufacturing
module process
rework probability
scheduling
dispatching algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.3
论文数:
1.1W
被引数:
3.7W
机构
引用论文
.png){kind=icon}
An optimal batch size for an imperfect production system with quality assurance and rework具有质量保证和返工的不完善生产系统的最佳批量大小
PREAI
分享收藏
查看更多内容