臺灣博碩士論文加值系統

台灣中小型晶圓代工廠其客戶規模較小，訂單有筆數多但量小的特性，而且對景氣之反應特別快，一有風吹草動，立刻會進行下急單或抽單之動作，因此中小型代工廠之生產規劃彈性及反應能力相對更顯重要。然而生產規劃作業必須整合客戶需求預估、訂單、在製品及產能等相關資訊，在少量多樣之產品組合下，必須運用有效率之工具，才能因應快速變化之市場需求。
本研究結合兩種啟發式演算法，組合生產線循序作業電腦方法及以優先權規則為基礎之啟發式演算法，設計生產規劃作業之生產排程演算法，同時參考派工法則與晶圓投片法則，並依晶圓代工廠需求及特性，設計適當之產能限制模型及晶圓投片規則，以此建構其生產規劃系統，以簡單、快速及有彈性的方法，產生合理可行之生產計劃，除提供經營管理者決策之用，同時做為製造廠之生產目標。
本研究成果可協助中小型晶圓代工廠，大幅縮短生產規劃作業之時間，增加規劃之彈性及效率；提高生產計畫之精細度，由製程微米與產品類別之彙總計劃，精細至訂單與需求配置之產品型號，提昇資訊分析之精細度及準確率；增加規劃晶圓投片期間，由只能預估月總投片量及依人工排定一週內之投片計劃，改善為能安排每日所有訂單及需求配置產品之投片計劃，提昇此計畫之透明度；提高生產規劃作業之頻率，由原只能二週一次正式之生產規劃作業，提高至每週一次，時間間隔縮短，使生產計畫能即時反映需求及生產狀況之變化，提供正確之資訊供經營管理者參考及決策。

In Taiwan, the scale of the customers of small and medium-sized wafer foundry companies are small. The characters of their orders are large number but less volume. Their reactions to the boom are very fast. The actions of delivering urgent orders and canceling orders are as usual. Base on the above reasons, the flexibility and reacting capability of the production planning of the foundry companies are more important.
The research combines two heuristic algorithms, COMSOAL and Priority rule-based algorithm, to design a production scheduling algorithm. Meanwhile it refers to dispatching rule and wafer start rule. Also base on the requirements and characters of wafer foundry companies, it designs proper capacity constraint model and wafer start rule to construct production planning system. Using simple, fast and flexible methods to generate reasonable and feasible production plans.
The result of the research has several contributions. First, it shortens the execution time of generating a production plan. Second, the resolution of production plan is raised from the summary of manufacturing process and product type to full product name of order and demand allocation. It improves the resolution and accuracy of information analysis. Third, the planning period of wafer start plan is improved from monthly to daily. Last, the frequency of production planning is improved from once a fortnight to once a week. The time interval is shortened. It lets the production plan can timely react to the change of demand and production status and provides the right information for the references and decision of high managements.

摘要 I
ABSTRACT II
誌謝 III
目錄 IV
圖目錄 VI
表目錄 VII
第一章、緒論 1
1.1 研究背景 1
1.2 研究動機 2
1.3 研究目的 3
1.4 研究步驟與論文架構 4
第二章、文獻探討 6
2.1 半導體晶圓製造生產作業 6
2.1.1 半導體製程 6
2.1.2 生產週期時間 11
2.2 生產規劃作業 13
2.2.1 多層式生產規劃 14
2.2.2 產能模型 15
2.2.3 派工法則 16
2.2.4 晶圓投片法則 17
2.3 啟發式演算法 18
2.3.1 組合生產線循序作業電腦方法 19
2.3.2 優先權規則為基礎的演算法 22
第三章、企業生產規劃問題與分析 26
3.1 生產規劃作業流程 26
3.2 問題定義與分析 28
第四章、系統模型及演算法設計 32
4.1生產規劃流程設計 32
4.2產能限制及製造路徑模型 32
4.2.1 產能及製造路徑模型 33
4.2.2 投片限制 34
4.2.3 產出限制 36
4.3生產規劃參數 37
4.3.1 生產週期時間 37
4.3.2 均勻投片配置規則 38
4.4生產規劃演算法 39
4.4.1需求排程順序規則 39
4.4.2生產排程演算法 43
第五章、系統實作及分析 56
5.1系統架構與流程 57
5.2系統功能實作 60
5.2.1產能限制參數設定介面 60
5.2.2 生產規劃參數設定介面 61
5.2.3 外部資料載入與處理模組 61
5.2.4 生產排程引擎模組 62
5.2.5 生產計畫與報表處理模組 65
5.3 實驗測試分析 66
5.3.1測試資料來源與實驗設計 66
5.3.2實驗結果分析 69
5.4效益分析 71
5.4.1縮短生產規劃作業時間 72
5.4.2提昇生產規劃之精細度 73
5.4.3增加生產規劃投片期間 74
5.4.4提高生產規劃作業頻率 75
第六章、結論與未來研究方向 76
6.1結論 76
6.2未來研究方向 77
參考文獻 78

1.拓墣產業研究所，「中國半導體產業趨勢大未來」，拓墣科技股份有限公司，2004
2.拓墣產業研究所，「中國半導體產業綜觀暨前景分析」，拓墣科技股份有限公司，2005
3.盧舜年，鄒坤霖，「供應鏈管理的第一本書」，商周出版，2002
4.莊達人，「VLSI製造技術」，高立圖書有限公司，1997
5.刁建成，「ULSI 製程技術」，全華科技圖書股份有限公司，2000
6.許棟樑，黃嘉若，「半導體製造廠黃光區機台規劃的模擬研究」，計量管理期刊，vol. 3, no. 1, page 79~94，2006
7.林於杏，蔡志弘，徐光宏，李慶恩，「半導體晶圓製造廠黃光區派工法則之研究」，中華管理評論，Vol. 6, No.6，2003
8.Scott S. Kramer，”Total Cycle Time Management by Operational Elements”， Semiconductor Manufacturing Science Symposium, p. 17-20，1989
9.G.C. Onwubolu, M.Mutingi，”A gnenetic algorithm approach to cellular manufacturing systems”， Computers and Industrial Engineering, Volume 39 , Issue 1-2, p. 125-144，2001
10.Dingwei Wang, Shu-cherng Fang，”A Genetics-Based Approach for Aggregated Production Planning in A Fuzzy Environment”， Systems, Man and Cybernetics, Volume: 27, Issue 5, p. 636-645，1997
11.A. Markus, J. Vancza, T. Kis, A. Kovacs，”Project Scheduling Approach to Proudction Planning”，Annals of the CIRP，2003
12.Chase, R. B., Aquilano, N. J.，”Production and operation management – a life cycle approach”，Homewood, IL, USA:Irwin，1989
13.B.P. Das, J,G. Rickard, N. Shah, S. Macchietto，”An investigation on integration of aggregate production planning, master production scheduling and short-term production scheduling of batch process operations through a common data model”， Computers and Chemical Engineering, Volume 24, Number 2, p. 1625-1631，2000
14.Sisler, S. Merrill, E. Sorrentino, P.，” Capacity analysis tool”， Advanced Semiconductor Manufacturing Conference, 2001 IEEE/SEMI，p. 77-79，2001
15.Suleyman Karabuk & S. David Wu，”Strategic capacity planning in the semiconductor industry: A stochastic programming approach”， Operations Research，2003
16.M Dummler, O Rose ，” Analysis of the Short Term Impact of Changes in Product Mix “，Proceedings of the 1999 International Conference on Semiconductor Manufacturing Operational Modeling and Simulation, p. 201-206，1999
17.E A Silver， “An overview of heuristic solution methods”, Journal of the Operational Research Society, Vol. 55, Issue. 9; p. 936，2004
18.Alberto De Toni & Antonella Meneghetti， “The production planning process for a network of firms in the textile-apparel industry”, International Journal of Production Economics, vol. 65, no. 1, p. 17-32，2000
19.Faruk Geyik & Ismail Hakki Cedimoglu， “A review of the production scheduling approaches based on artificial intelligence and the integration of process planning and scheduling”, Proceedings of Swiss Conference of CAD/CAM，1999
20.Ronald L. Rardin ,Reha Uzsoy， “Experimental Evaluation of Heuristic Optimization Algorithms: A Tutorial”, Journal of Heuristics, Volume 7, Number 3, p. 261 – 304，2001
21.Arcus, A. L.，“COMSOAL: a computer method of sequencing operations for assembly lines”, International Journal of Production Research, 4, p.259~277，1966
22.Dar-El, E. M.， “Solving large single-model assembly line balancing problems – a comparative study”, AIIE Transactions,7, p.302~310，1975
23.Erel, E., & Sarin, S.， “A survey of the assembly line balancing procedures”, Production Planning and Control, 9, p.414~434，1998
24.Ignall, E. J.， “A review of assembly line balancing”, Journal of Industrial Engineering, 16, p. 244~254，1965
25.Mastor, A. A.， “An experimental investigation and comparative evaluation of production line balancing techniques”, Management Science, 16, p.728~746，1970
26.Osman, R., & Shing, O. N.， “Assembly Line Balancing Using DBMS”, 1986 International Industrial Engineering Conference Proceedings, p. 94-99，1986
27.Whitehouse & Tidwell, D.， “A comparison of computer search heuristics to analyze activity networks with limited resources”, Proceedings of the ORSA/TIMS Conference.，1980
28.DePuy & Whitehouse， “Applying the COMSOAL computer heuristic to the constrained resource allocation problem”, Computers and Industrial Engineering, Volume 38, Number 3, p. 413-422，2000
29.DePuy & Whitehouse, “A simple and effective heuristic for the resource constrained project scheduling problem”, International Journal of Production Research, Volume 39, Number 14, p. 3275 – 3287，2001
30.Boctor, F., “Some efficient multi–heuristic procedures for resource–constrained project scheduling”, European Journal of Operational Research 49, p.3–13，1990
31.Thomas, P. & S. Salhi, “An investigation into the relationship of heuristic performance with network–resource characteristics”, Journal of the Operational Research Society 48, 1, p.34–43，1997
32.Cooper, D., “Heuristics for scheduling resource–constrained projects: An experimental investigation”, Management Science 22, 11, p.1186–1194，1976
33.Kolisch, “Efficient priority rules for the resource-constrained project scheduling problem”, Journal of Operations Management, Volume 14, Number 3, p. 179-192，1996
34.Robert Klein, “Bidirectional planning: improving priority rule-based heuristics for scheduling resource-constrained projects”, European Journal of Operational Research, Volume 127, Number 3, p. 619-638，2000
35.Pilar Tormos & Antonio Lova, “A Competitive Heuristic Solution Technique for Resource-Constrained Project Scheduling”, Annals of Operations Research, Volume 102, Numbers 1-4, p. 65-81，2001
36.Kolisch & Hartmann,” Heuristic algorithms for solving the resource-constrained project scheduling problem: Classification and computational analysis”, Handbook on Recent Advances in Project Scheduling, edited by J. Weglarz, p. 147-178，1999
37.Robert Klein, “Project scheduling with time-varying resource constraints”, International Journal of Production Research, Volume 38, Number 16, p. 3937 – 3952，2000
38.Sprecher, Kolisch & Drexl, “Semi-active, active and nondelay schedules for the resource-constrained project scheduling problem”, European Journal of Operational Research, 80, p.94-102，1995