https://scholars.lib.ntu.edu.tw/handle/123456789/81898
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor | 周雍強 | en |
dc.contributor | 臺灣大學:工業工程學研究所 | zh_TW |
dc.contributor.author | 王俊淵 | zh |
dc.contributor.author | Wang, Chun-Yuan | en |
dc.creator | 王俊淵 | zh |
dc.creator | Wang, Chun-Yuan | en |
dc.date | 2004 | en |
dc.date.accessioned | 2007-11-26T01:05:16Z | - |
dc.date.accessioned | 2018-06-29T00:33:24Z | - |
dc.date.available | 2007-11-26T01:05:16Z | - |
dc.date.available | 2018-06-29T00:33:24Z | - |
dc.date.issued | 2004 | - |
dc.identifier | zh-TW | en |
dc.identifier.uri | http://ntur.lib.ntu.edu.tw//handle/246246/51192 | - |
dc.description.abstract | 隨著半導體供應鏈的發展,各家企業廠商之間的關係錯綜複雜,形成動態網絡,各節點的決策行為是以自身企業利益目標進行規劃,一個節點的生產派工決策、產能、排程資訊與其他節點的活動存在互動牽連的關係,因此形成企業從本身的生產規劃延伸到與其它企業間的協調及合作機制;同時,造成上中下游整合的趨勢以完成產品製造之使命。因此本文針對晶圓前端製程流程,製造廠及針測廠間之生產特性,發展一生產規劃架構,用以規劃各階段最適宜生產之產品等級別及數量。 本論文包含兩大規劃程序,首先為晶圓製造廠的生產規劃程序,在此根據企業所規劃各產品之產出目標,考量晶圓製造各機台之產能水準、各製程機台之機能及同產品族生產數量等限制,在設定績效下,求算出晶圓製造廠生產之產品別以及數量。接著,配合生產週期時間的估算,推估出各工單之可交貨日程表等資訊,以利晶圓針測廠之生產規劃程序之運作。 接著在晶圓針測廠生產規劃程序中,則是彙整晶圓製造廠之生產規劃機制所推得的各工單之預計可交貨日、產品別及產出量等資訊,考量針測廠可提供之產能水準、機台製程規格能力等限制,求算針測廠各機台應分擔各類產品之負荷量,以及規劃期間內的最終機台設定位置。利用上述結果,再將機台指派規劃工作產出的資訊---工單對機台的派令(assignments),作為依據的決策方法與規劃目標產生排程結果。 本研究選擇B-shop機台分派的設定轉換次作為績效考量,作為與F-shop協同生產排程規劃的指標。透過本研究構建之生產規劃架構,來進行協同式生產排程的分析,並以實驗討論有進行協同規劃比未進行協同規劃所帶來效益較佳。 | zh_TW |
dc.description.abstract | Following the development of semiconductor industry, the relationship between firms in supply chains is very complex. The performance of supply chains depends much on the integration of business processes, decision-making and information systems. The production planning of an enterprise thus is extended for cooperating with others. Moreover, there is a trend to integrate the whole semiconductor factories for achieving the mission of producing final products. This study will focus on wafer fabrication and probing process and will develop a collaborative production planning system. Two core mechanisms are addressed in this thesis. The first is master scheduling system for the wafer fabrication. According to the throughput plan of the enterprise, we derive product mix with the considerations of the capacity limitation of each site, in order to suit the performance. Next, based on the estimated cycle time, we can predict the due date of each order that is an input data for the production planning system of probing process. The production planning mechanism for the wafer probing factory aggregates planning results of wafer fabrication, such as predicted due date of each order, throughput target of each product type, capacity supply and capability constraints of every workstation. With this result, this thesis then assign job-order of each product type to the workstation and provide last setup configuration of machines. In this study, the interaction between two nodes is discussed about B-shop setup changeover rate as a performance index. We developed a framework to integrate scheduling and planning processes and obtain better performance evaluation. | en |
dc.description.tableofcontents | 第1章 緒論 - 1 - 1.1 研究背景與動機 - 2 - 1.2 問題描述 - 3 - 1.2.1 動態需求資訊 - 5 - 1.2.2 資訊分享 - 7 - 1.2.3 機台分派問題 - 8 - 1.2.4 考慮重新分派的因素 - 10 - 1.3 研究目的 - 11 - 1.3.1 CSP的特性簡介 - 12 - 1.3.2 解品質的衡量 - 14 - 1.4 研究方法 - 16 - 1.5 論文組織與架構 - 17 - 第2章 文獻回顧 - 18 - 2.1 供應鏈協同(Supply Chain Collaboration) - 18 - 2.1.1 供應鏈整合層次 - 18 - 2.1.2 供應鏈中資訊分享的重要性 - 20 - 2.2 資訊價值之相關文獻 - 23 - 2.2.1 資訊價值介紹 - 23 - 第3章 限制式滿足問題規劃模式 - 26 - 3.1 限制式規劃(Constraint Programming, CP) - 26 - 3.1.1 限制式滿足問題簡介 - 26 - 3.1.2 發展背景 - 27 - 3.2 限制式滿足問題的表述方式 - 28 - 3.3 限制式滿足技術 - 30 - 3.3.1 搜尋演算法(Search Algorithm) - 30 - 3.3.2 一致性技巧(Consistency Technique) - 32 - 3.3.3 排序演算法(Ordering Algorithm) - 32 - 3.4 最佳化問題之限制式規劃求解概念 - 33 - 3.5 限制式滿足問題規劃與數學規劃之比較 - 35 - 3.5.1 規劃方法分析比較 - 35 - 3.5.2 評估指標 - 36 - 第4章 協同整合生產規劃的基礎架構 - 37 - 4.1 整體邏輯與架構 - 38 - 4.2 前端晶圓製造之生產排程規劃 - 39 - 4.2.1 排程的運算流程 - 39 - 4.2.2 整數線性規劃排程模式(ILP scheduling model )- 41 - 4.2.3 限制滿足規劃排程模式(CSP scheduling model )- 43 - 4.3 後端晶圓針測機台分派模組的環境 - 45 - 4.3.1 模型假設 - 46 - 4.3.2 機台分派運算流程 - 47 - 4.3.3 資料型別與內容 - 47 - 4.3.4 模型符號與變數說明 - 50 - 4.3.5 數學模型 - 51 - 4.3.6 小結 - 53 - 4.4 可行解求解階段 - 53 - 4.4.1 整體貢獻值推估 - 54 - 第5章 協同式生產規劃範例說明 - 55 - 5.1 協同規劃程序之整合 - 55 - 5.2 參數設定 - 57 - 5.2.1 F-shop生產排程範例 - 57 - 5.2.2 B-shop機台分派範例 - 60 - 5.3 整合流程的範例說明 - 62 - 5.4 整合模式整體貢獻值評估 - 65 - 第6章 結論與未來展望 - 69 - 6.1 結論 - 69 - 6.2 後續研究建議 - 70 - | zh_TW |
dc.format.extent | 2669176 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language | zh-TW | en |
dc.language.iso | en_US | - |
dc.subject | 供應鏈 | en |
dc.subject | 效益評估 | en |
dc.subject | 協同規劃 | en |
dc.subject | performance | en |
dc.subject | collaborative planning | en |
dc.subject | supply chain | en |
dc.subject.classification | [SDGs]SDG11 | - |
dc.title | 供應鏈協同式之生產規劃架構 | zh |
dc.title | A Collaborative Framework of Production Planning System for Supply Chains | en |
dc.type | thesis | en |
dc.identifier.uri.fulltext | http://ntur.lib.ntu.edu.tw/bitstream/246246/51192/1/ntu-93-R90546021-1.pdf | - |
dc.relation.reference | 參考文獻 [1].蔡瑞隆,”供應鏈中存貨系統資訊價值之探討,”2001, 私立東海大學工業工程學系研究所碩士論文。 [2].楊森豪 (Yang, S. H),”結合系統動力學與類神經網路評估資訊之價值,”民國84年,國立中山大學資訊管理研究所碩士論文。 [3].張榮圳,"供應鏈管理資訊分享模式之研究," 2000,中山大學資訊管理研究所碩士論文。 [4].Clark T. D.,Jr. and Fred K. Augustine ,Jr., 1992,“Using System Dynamics to Measure the Value of Information in A Business Firm,” System Dynamics Review, Vol. 8 ,No.2, pp.149-174. [5].Chen, M. D., “Constraint Modeling for the Assignment Problems of Parallel Machines Systems,” Master thesis, GIIE, NTU, 2002. [6].Frederix F., 1996, “Planning and Scheduling Multi-Site Semiconductor Production Chains: A Survey of Needs, Current Practices and Integration Issues,” Conference on IT and Manufacturing Partnerships: Delivering the Promise, Galway, Ireland, pp. 107-116. [7].Gallagher, Charles A., 1974, ”Perceptions of the Value of a Management Information System,”Academy of Management Journal ,Vol.17, pp.46-55. [8].Gilbert, S. M. and Ballou, R. H., 1999, “Supply Chain Benefits from Advanced Customer Commitments,” Journal of Operations Management, 18, 61-73. [9].Handfield, R. B. and Nichols, E. L., 1999 , "Introduction to Supply Chain Management," Prentice-Hall Internation Editions. [10].Hsu, C. J., “A Constraint Satisfaction Engine for Collaborative Planning and Scheduling,” Master thesis, GIIE, NTU, 2003. [11].Ketzenberg, M.E., Marucheck, A.E., and Metters, R.D., 2000, “Information value for supply chain inventory replenishment”, Proceedings 2000 of the Decision Sciences Institute, pp. 1206-1208. [12].Kumar, V. , 1992, "Algorithms for Constraint-Satisfaction Problems: A Survey", AI Magazine, 13(1, Spring). [13].Lee, H.L., So, K.C., and Tang, C.S., 2000, “The value of information sharing in a two-level supply chain,” Management Science, Vol. 46, No. 5, pp.626-643. [14].Lee, H.L. & S. Whang, 2000, “Information Sharing in a Supply Chain”, International Journal of Technology Management, 20(3/4), pp373-387. [15].Johnston, R. and P.R. Lawrence, 1988, “Beyond Vertical Integration: The Rise of the Value-Adding Partnership”, Harvard Business Review, 66(4), pp.94-101. [16].Mock, Theodore J., October 1971,“Concepts of Information Value and Accounting,”The Accounting Review, Vol.46, pp.765-778. [17].Morgan, R. M. and S. D. Hunt, 1994, “The Commitment-Trust Theory of Relationship Marketing,” Journal of Marketing, 58(1), pp.20-38. [18].Pascal Van Hentenryck, April 2001,“ILOG OPL Studio 3.5:Language Manual”. [19].Raghunathan, S., 2001, "Information Sharing in a Supply Chain: A Note on its Value when Demand Is Nonstationary," Management Science, Vol. 47, No. 4, pp. 605-610. [20].S. Heipcke, 1999,“Comparing Constraint Programming and Mathematical Programming Approach to Discrete Optimization: the Change Problem,” Journal of the Operation Research Society, Vol. 50, pp.581-595. [21].Sally C. Brailsford, Chris N. Potts and Barbara M. Smith, 1999, “Constraint Satisfaction Problems: Algorithms and Applications.” European Journal of Operational Research, 119, pp.557-581. [22].Simchi-Levi, D., Kaminsky, P., and Simchi-Levi, E., 2000, “Designing and Managing the Supply Chain: concepts, strategies, and case studies”, Boston: Irwin, McGraw-Hill. [23].Srinagesh Gavirneni, 1999, “Value of Information on Capacitated Supply Chain,” Management Science Vol.45 No.1 Jan, pp.16-24. [24].Tsang, E. and Kwan, A., 1993, " Mapping Constraint Satisfaction Problems to Algorithms and Heuristics", Technical Report CSM254, Department of Computer Science, University of Essex, Colchester. [25].Tsang, E., 1993, "Foundations of Constraint Satisfaction", Harcourt Brace and Company. [26].Uzsoy R., Lee, C. Y., and Martin-Vega, L. A., “A Review of Production Planning and Scheduling Models in the Semiconductor Industry Part I: System Characteristics, Performance Evaluation and Production Planning,” IIE Transactions, Vol. 24, No. 4, 1992, pp 47-60. [27].Wu, C. S., “A Methodology to Evaluate Production Performances in Dynamic Capacity of Semiconductor Industries,” Master thesis, GIIE, NTU, 2001, pp. 75. | zh_TW |
item.openairecristype | http://purl.org/coar/resource_type/c_46ec | - |
item.openairetype | thesis | - |
item.languageiso639-1 | en_US | - |
item.grantfulltext | open | - |
item.cerifentitytype | Publications | - |
item.fulltext | with fulltext | - |
顯示於: | 工業工程學研究所 |
檔案 | 描述 | 大小 | 格式 | |
---|---|---|---|---|
ntu-93-R90546021-1.pdf | 23.53 kB | Adobe PDF | 檢視/開啟 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。