.png){kind=icon}
返回
A case study on the multistage IC final testing scheduling problem with reentry
.png){kind=icon}
PRE
AI
DOI：10.1016/S0925-5273(03)00186-5.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The integrated-circuit final testing scheduling problem (ICFTSP) with reentry is a variation of the complex flow-shop scheduling problem, which is also a generalization of the classical reentrant flow batch process problem, and the identical parallel machine problem. In this paper, we present a case study on the ICFTSP with reentry, which is taken from a final testing shop floor in an integrated circuit manufacturing factory. For the case investigated, the jobs are clustered by their product types, which must be processed on groups of parallel machines at various process stages following the manufacturing sequence, which must be completed before the due dates. The job processing time depends on the product type, and the machine setup time is sequentially dependent on the orders of jobs processed. The objective is to schedule jobs without violating all constraints, while the total machine workload is minimized. Since the ICFTSP has reentry characteristic, and involves job processing precedence, serial-processing stage, batch-processing stage, job clusters, job-cluster dependent processing time, due dates, machine capacity, and sequence dependent setup time, it is more difficult to solve than the classical flow-shop scheduling problem. We present three fast network algorithms to efficiently solve the ICFTSP with reentry and provide a performance comparison between the three algorithms on eight test problems. (C) 2003 Elsevier B.V. All rights reserved.
Keyword:
reentrant flow lines
complex flow shop
parallel-machine scheduling problem
sequence dependent setup time
due date
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10
论文数:
8.0K
被引数:
3.6W
机构
暂无机构信息
引用论文
Finding near neighbors through cluster pruning.png)
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systemsIF0
PREAI
分享收藏分享收藏A PARALLEL ROUTE BUILDING ALGORITHM FOR THE VEHICLE-ROUTING AND SCHEDULING PROBLEM WITH TIME WINDOWS带时间窗的车辆路径和调度问题的并行路径构建算法
PREAI
分享收藏
查看更多内容