A GA-Tabu algorithm for scheduling in-line steppers in low-yield scenarios
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
11933 | en_US |
dc.citation.issue |
9 | en_US |
dc.citation.spage |
11925 | en_US |
dc.citation.volume |
36 | en_US |
dc.citation.woscount |
2 | |
dc.contributor.author |
Chiou, Chie-Wun | en_US |
dc.contributor.author |
Wu, Muh-Cherng | en_US |
dc.contributor.department |
工業工程與管理學系 | zh_TW |
dc.contributor.department |
Department of Industrial Engineering and Management | en_US |
dc.date.accessioned |
2014-12-08T15:08:22Z | |
dc.date.available |
2014-12-08T15:08:22Z | |
dc.date.issued |
2009-11-01 | en_US |
dc.description.abstract |
This paper presents a scheduling algorithm for an in-line stepper in low-yield scenarios, which mostly appear in cases when new process/production is introduced. An in-line stepper is a bottleneck machine in a semiconductor fab. Its interior comprises a sequence of chambers, while its exterior is a dock equipped with several ports. The transportation unit for entry of each port is a job (a group of wafers), while that for each chamber is a piece of wafer. This transportation incompatibility may lead to a capacity-loss, in particular in low-yield scenarios. Such a capacity-loss could be alleviated by effective scheduling. The proposed scheduling algorithm, called GA-Tabu, is a combination of a genetic algorithm (GA) and a tabu search technique. Numerical experiments indicate that the GA-Tabu algorithm outperforms seven benchmark ones. In particular, the GA-Tabu algorithm outperforms a prior GA both in solution quality and computation efforts. (C) 2009 Elsevier Ltd. All rights reserved. | en_US |
dc.identifier.doi |
10.1016/j.eswa.2009.03.064 | en_US |
dc.identifier.issn |
0957-4174 | en_US |
dc.identifier.journal |
EXPERT SYSTEMS WITH APPLICATIONS | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1016/j.eswa.2009.03.064 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/6486 | |
dc.identifier.wosnumber |
WOS:000268270600058 | |
dc.language.iso |
en_US | en_US |
dc.subject |
Scheduling | en_US |
dc.subject |
Semiconductor | en_US |
dc.subject |
Flow shop | en_US |
dc.subject |
Port capacity constraints | en_US |
dc.subject |
Meta-heuristic algorithm | en_US |
dc.subject |
Genetic algorithm | en_US |
dc.subject |
Tabu search | en_US |
dc.title |
A GA-Tabu algorithm for scheduling in-line steppers in low-yield scenarios | en_US |
dc.type |
Article | en_US |
檔案
- 000268270600058.pdf (399.9 KB, Adobe PDF)
所屬典藏: 期刊論文
引用此條目
Chiou, C.-W., & Wu, M.-C. (2009). A GA-Tabu algorithm for scheduling in-line steppers in low-yield scenarios. EXPERT SYSTEMS WITH APPLICATIONS, 36(9), 11925–11933. https://doi.org/10.1016/j.eswa.2009.03.064
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/6486