Heuristic algorithms to solve the capacity allocation problem in photolithography area (CAPPA)
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
452 | en_US |
dc.citation.issue |
3 | en_US |
dc.citation.spage |
431 | en_US |
dc.citation.volume |
30 | en_US |
dc.citation.woscount |
4 | |
dc.contributor.author |
Chung, Shu-Hsing | en_US |
dc.contributor.author |
Huang, Chun-Ying | en_US |
dc.contributor.author |
Lee, Amy H. I. | en_US |
dc.contributor.department |
工業工程與管理學系 | zh_TW |
dc.contributor.department |
Department of Industrial Engineering and Management | en_US |
dc.date.accessioned |
2014-12-08T15:11:26Z | |
dc.date.available |
2014-12-08T15:11:26Z | |
dc.date.issued |
2008-06-01 | en_US |
dc.description.abstract |
Wafer fabrication is one of the most complex and high competence manufacturing. How to fully utilize the machine capacity to meet customer demand is a very important topic. In this paper, we address the capacity allocation problem for photolithography area (CAPPA), which belongs to a capacity requirement planning scheme, with the process window and machine dedication restrictions that arise from an advanced wafer fabrication technology environment. Process window means that a wafer needs to be processed on machines that can satisfy its process capability (process specification). Machine dedication means that once the first critical layer of a wafer lot is processed on a certain machine, the subsequent critical layers of this lot must be processed on the same machine to ensure good quality of final products. We present six modified heuristics and a linear-programming-based heuristic algorithm (LPBHA) to solve the problem efficiently. The performance of the proposed algorithms is tested using real-world CAPPA cases taken from wafer fabrication photolithography area. Computational results show that LPBHA is the most effective one, and with a least average and a least standard deviation of deviation ratio of 0.294 and 0.085% compared to the lower bound of the CAPPA. | en_US |
dc.identifier.doi |
10.1007/s00291-007-0093-4 | en_US |
dc.identifier.issn |
0171-6468 | en_US |
dc.identifier.journal |
OR SPECTRUM | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1007/s00291-007-0093-4 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/8773 | |
dc.identifier.wosnumber |
WOS:000255754000003 | |
dc.language.iso |
en_US | en_US |
dc.subject |
photolithography area | en_US |
dc.subject |
process window | en_US |
dc.subject |
machine dedication | en_US |
dc.subject |
heuristic | en_US |
dc.subject |
linear programming | en_US |
dc.title |
Heuristic algorithms to solve the capacity allocation problem in photolithography area (CAPPA) | en_US |
dc.type |
Article | en_US |
檔案
- 000255754000003.pdf (527.8 KB, Adobe PDF)
所屬典藏: 期刊論文