請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/41168
完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.advisor | 楊烽正 | |
dc.contributor.author | Chun-Nan Kuo | en |
dc.contributor.author | 郭俊男 | zh_TW |
dc.date.accessioned | 2021-06-14T17:21:17Z | - |
dc.date.available | 2018-07-01 | |
dc.date.copyright | 2008-07-30 | |
dc.date.issued | 2008 | |
dc.date.submitted | 2008-07-24 | |
dc.identifier.citation | Akcalt, E., K. Nemoto, et al. (2001). 'Cycle-time improvements for photolithography process in semiconductor manufacturing.' Semiconductor Manufacturing, IEEE Transactions on 14(1): 48-56.
Beasley, D., D. R. Bull, et al. (1993). 'An Overview of Genetic Algorithms :Part 1, Fundamentals.' University Computing 15(2): 58-69. Blackstone, J. H., D. T. Phillips, et al. (1982). 'A state-of-the-art survey of dispatching rules for manufacturing job shop operations.' International Journal of Production Research 20(1): 27 - 45. Chern, C.-C. and Y.-L. Liu (2003). 'Family-based scheduling rules of a sequence-dependent wafer fabrication system.' Semiconductor Manufacturing, IEEE Transactions on 16(1): 15-25. Cho, K. H. and J. T. Lim (1998). 'Synthesis of fault-tolerant supervisor for automated manufacturing systems: a case study on photolithographic process.' Robotics and Automation, IEEE Transactions on 14(2): 348-351. Gen, M. and R. Cheng (1997). Genetic Algorithms and Engineering Design. New York Wiley, John & Sons. Gilbert, S. (1989). Uniform crossover in genetic algorithms. Proceedings of the third international conference on Genetic algorithms. George Mason University, United States, Morgan Kaufmann Publishers Inc. Goldberg, D. E. (1989). Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley Longman Publishing Co., Inc. Liu, A., P. P. Chen, et al. (2006). Using a Multiagent Scheduling System for Dedicated Machine Constraint in Semiconductor Manufacturing. Systems, Man and Cybernetics, 2006. SMC '06. IEEE International Conference on. Lou, S. X. C. and P. W. Kager (1989). 'A robust production control policy for VLSI wafer fabrication.' Semiconductor Manufacturing, IEEE Transactions on 2(4): 159-164. Lozinski, C. and C. R. Glassey (1988). 'Bottleneck starvation indicators for shop floor control [semiconductor manufacturing process].' Semiconductor Manufacturing, IEEE Transactions on 1(4): 147-153. Lu, S. C. H., D. Ramaswamy, et al. (1994). 'Efficient scheduling policies to reduce mean and variance of cycle-time in semiconductor manufacturing plants.' Semiconductor Manufacturing, IEEE Transactions on 7(3): 374-388. Pearn, W. L., S. H. Chung, et al. (2008). 'Solution strategies for multi-stage wafer probing scheduling problem with reentry.' Journal of the Operational Research Society 59(5): 637-651. Shr, A., A. Liu, et al. (2008). 'A heuristic scheduling approach to the dedicated machine constraint.' International Journal on Artificial Intelligence Tools 17(2): 339-353. Shr, A. M. D., A. Liu, et al. (2008). 'Load balancing among photolithography machines in the semiconductor manufacturing system.' Journal of Information Science and Engineering 24(2): 379-391. Shu, L., T. Tang, et al. (1996). 'Minimum inventory variability schedule with applications in semiconductor fabrication.' Semiconductor Manufacturing, IEEE Transactions on 9(1): 145-149. Uzsoy, R., C.-Y. Lee, et al. (1992). 'A review of production planning and scheduling models in the semiconductor industry, Part-I: System characteristics, performance evaluation and production planning.' IIE Transactions 24(4): 47 - 60. Vignaux, G. A. and Z. Michalewicz (1991). 'A genetic algorithm for the linear transportation problem.' Systems, Man and Cybernetics, IEEE Transactions on 21(2): 445-452. Wang, Z., Q. Wu, et al. (2007). 'A Lot Dispatching Strategy Integrating WIP Management and Wafer Start Control.' Automation Science and Engineering, IEEE Transactions on [see also Robotics and Automation, IEEE Transactions on] 4(4): 579-583. Yan, H., S. Lou, et al. (1996). 'Testing the robustness of two-boundary control policies in semiconductor manufacturing.' Semiconductor Manufacturing, IEEE Transactions on 9(2): 285-288. 游淑晴 (2002). 黃光區關鍵層機台限制下之投料與派工法則的探討. 工業工程與工程管理系. 新竹, 國立清華大學. 碩士. | |
dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/41168 | - |
dc.description.abstract | 黃光微影製程是晶圓製造重要的瓶頸製程。在製程良率的考量下,黃光區派工問題具有多樣且複雜的製程限制,常以人工方式進行黃光區派工。本研究經與業界多次訪談後,建立符合實務的求解模式,綜合考量緊急晶圓批優先權、機台關鍵層負載量平衡、關鍵層綁機台限制、機台製程能力限制、以及實務上會加入排程的光罩試曝和擋片作業等。在此模式下,本研究提出一以遺傳演算法為基的時窗滾動式黃光區機台排程優化法,求解實際的黃光區機台派工問題。此時窗滾動為基的作法係由當下時間往後延伸一時段形成時窗,考量時窗內的晶圓批排程需求。排程對象是目前已在黃光區及時窗內預期到達的晶圓批。隨著時間的遞移,此時窗往前滾動進行遺傳演化重排程。停留時間加權值最小化、非製程加工的額外時間最小化、最晚完工時間最小化、和機台執行關鍵層負載不平均量最小化是本研究定義的四個優化子目標,引導排程朝著提昇機台利用率、增加產出量、降低晶圓批週期時間、及減少額外作業時間浪費的結果演化。為驗證本求解模式的成效及實用性,本研究並實作一套「遺傳演算之時窗滾動式黃光區排程系統」,以具物件導向特性的黃光區模擬實驗平台,讀入實際黃光區運作的晶圓到達歷史資料,模擬時窗滾動觸發排程系統進行排程派工,設定晶圓批層級加工的機台及排定加工時程。本研究並定義平均機台利用率、完成量、晶圓批平均生產週期時間、額外作業時間等四個效能指標,以評斷排程方法的成效。實驗數據顯示本研究提出的排程方法優於人工派工及簡單的先到先派工法。此外實驗結果也顯示在適當的時窗時程設定下,整個派工成效有顯著的提昇。 | zh_TW |
dc.description.abstract | The operation management of photolithography area is the most important yet difficult task in semiconductor manufacturing. Due to numerous constraints and operation goals imposed, manual decision and action are adopted in scheduling and dispatching the jobs for the machines in this area. The operation requirements and constraints considered in this paper include lot-priority, machine load balance for critical layers, machine bounded by critical layers, heterogeneous processing capability, reticle pilot run, dummy wafer test, etc. Under these considerations, this paper presents a time window rolling- and GA-based scheduling system to assign and schedule both the arrived and on-the-way wafer lots to the photolithography machines. Time window is defined when the scheduler is triggered by extending a time period to round in the wafer lots on the way to the photo area within this window. The scheduled jobs are then executed accordingly until the next scheduling event is triggered; and thus the widow rolls. The presented model proposed four minimization sub-goals, weighted cycle time, extra time, makespan, and critical layer loading unbalanced value, to conduct the scheduling results to enhancing the machine utilization and throughput while reducing cycle time and nonproductive time. To verify the proposed GA model, a prototype system namely “Photolithography Area Simulation System,” was developed implementing the proposed scheduling method and a simulation platform for the photolithography area. In addition, four performance indices are proposed, tool utilization, throughput, cycle time, and extra operation time, for evaluating the scheduling methods. Numerical tests were conducted using historical operation data from a Taiwanese DRAM manufacturing factory. Production activities are simulated by the historical data and executed by the scheduling results from the proposed model. Results showed that the proposed method outperformed the manual one and a simple FCFS scheduling method. In particular, the performance improvement reached a peak subject to a time window width specification. | en |
dc.description.provenance | Made available in DSpace on 2021-06-14T17:21:17Z (GMT). No. of bitstreams: 1 ntu-97-R95546017-1.pdf: 1607364 bytes, checksum: a6dcd71f70dfef42ac282abba2972c43 (MD5) Previous issue date: 2008 | en |
dc.description.tableofcontents | 誌謝 i
中文摘要 ii Abstract iii 目錄 v 圖目錄 vii 表目錄 ix 中英文名詞對照表 x 符號列表 xiii 第1章 緒論 1 1.1 研究背景與動機 1 1.2 研究目的 2 1.3 研究流程 3 1.4 章節概要 4 第2章 黃光區派工問題之文獻探討及遺傳演算法相關技術 6 2.1 黃光區派工問題 6 2.1.1 黃光微影製程(Lithography) 6 2.1.2 黃光區派工研究 8 2.2 遺傳演算法 12 2.3 文獻探討小結 22 第3章 晶圓廠黃光區派工遺傳演算法 23 3.1 晶圓廠黃光區機台派工問題描述 23 3.2 黃光區派工問題模型的資料結構 31 3.3 滾動式遺傳演算法為基的動態黃光區派工法 36 3.3.1 求解模式 36 3.3.2 晶圓批為基的基因編碼法(lot-based encoding) 42 3.3.3 晶圓族為基的基因編碼法(family based encoding) 43 3.3.4 基因解碼�排程演算程序及資料結構 47 3.3.5 遺傳演算目標函式 53 3.3.6 黃光區滾動式派工遺傳演算法 56 第4章 求解方法效能分析及實例驗證 64 4.1 模擬實驗平台 64 4.2 排程系統介紹 69 4.3 實際範例資料 70 4.4 績效衡量指標 77 4.5 演算法子目標望小的影響力探討 80 4.6 晶圓批及晶圓族編碼模式的求解效能比較 84 4.7 滾動時窗大小探討 85 4.8 實例測試 88 第5章 結論與未來研究建議 92 5.1 結論 92 5.2 未來研究建議 93 參考文獻 95 | |
dc.language.iso | zh-TW | |
dc.title | 遺傳演算法為基的滾動式時窗排程法求解動態黃光區派工問題 | zh_TW |
dc.title | A Time Window Rolling- and GA-Based Method for the Dynamic Dispatching Problem in Photolithography Area | en |
dc.type | Thesis | |
dc.date.schoolyear | 96-2 | |
dc.description.degree | 碩士 | |
dc.contributor.oralexamcommittee | 歐陽超,周雍強,陳琨太,吳政鴻 | |
dc.subject.keyword | 黃光區派工問題,綁機,回流,滾動式,遺傳演算法,動態, | zh_TW |
dc.subject.keyword | Photolithography Area,Scheduling and dispatching,Time Window Rolling,Genetic Algorithm, | en |
dc.relation.page | 97 | |
dc.rights.note | 有償授權 | |
dc.date.accepted | 2008-07-26 | |
dc.contributor.author-college | 工學院 | zh_TW |
dc.contributor.author-dept | 工業工程學研究所 | zh_TW |
顯示於系所單位: | 工業工程學研究所 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-97-1.pdf 目前未授權公開取用 | 1.57 MB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。