跳到主要內容

臺灣博碩士論文加值系統

(54.225.48.56) 您好!臺灣時間:2022/01/19 21:14
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

: 
twitterline
研究生:劉其昌
研究生(外文):Liu Chi Chang
論文名稱:晶圓批量異常等待時間為導向之派工法則
論文名稱(外文):Dispatching rules based on unexpected waiting time of eafer lots
指導教授:巫木誠巫木誠引用關係
指導教授(外文):Muh-Cherng Wu
學位類別:碩士
校院名稱:國立交通大學
系所名稱:工業工程與管理系
學門:工程學門
學類:工業工程學類
論文種類:學術論文
論文出版年:2002
畢業學年度:90
語文別:中文
論文頁數:56
中文關鍵詞:派工法則異常等待生產週期時間
外文關鍵詞:dispatching rulesunexpected waiting timecommitted cycle time
相關次數:
  • 被引用被引用:19
  • 點閱點閱:490
  • 評分評分:
  • 下載下載:141
  • 收藏至我的研究室書目清單書目收藏:2
在顧客至上的理念下,滿足顧客之交期已成為晶圓廠首要之目的,但由於製造現場常會發生當機,使得生產週期時間產生劇烈變化,進而影響產品交期,故生產週期時間的控制已成為製造現場最重要的課題。
「派工」,為製造現場動態控制生產週期時間的方法,一般常用之派工,如CR,僅將生產週期分成兩部分:純加工時間與等待時間,來作為選擇加工優序之依據。但生產週期時間會發生變異,主要是因製造現場發生當機而使批量發生異常等待所致,故本研究進一步將生產週期時間解構成三部分:純加工時間、正常等待時間與當機所造成之異常等待時間,並且以異常等待時間作為選擇加工優序之依據,依據模擬結果顯示,以異常等待時間為導向之派工法則績效明顯優於其他派工法則。
This research develops several dispatching rules for IC foundries in order to improve the on-time delivery. On-time delivery is a key performance indicator in an IC foundry. Yet, it cannot be well controlled due to the occurrence of unexpected events such as machine down. This research decomposes the cycle time into three parts: processing time, expected waiting time, and unexpected waiting time. The expected waiting time concerns the waiting of lots in the case of no unexpected events. The unexpected waiting is concerned with the waiting of lots caused by unexpected events. In this research, each lot is given a time buffer to accommodate the unexpected events. The basic idea is that lots with less remaining time buffer is more urgent and has higher dispatching priority. Several dispatching indicators based on this idea has been developed and tested by simulation. Simulation results using 10 seeds show that one of the proposed dispatching rules, MCR (modified Critical Ratio), in average is better than other dispatching methods in literature.
中文摘要 i
Abstract ii
誌 謝 iii
目錄 iv
表目錄 vi
圖目錄 vii
第一章 緒論 1
1.1 研究背景 1
1.2 研究目的 3
1.3 論文章節安排 4
第二章 文獻回顧 6
2.1 派工法則 6
2.1.1 一般常用之派工法則 6
2.1.2 批次機台之派工法則 8
2.2 控制交期之派工法則 10
2.3 生產績效衡量指標 11
2.3 分析與討論 13
第三章 接單規劃與投料法則 14
3.1 Pacemaker MCP簡介 14
3.1.1 Pacemaker MCP的輸入資料 14
3.1.2 Pacemaker MCP之功能 15
3.1.3 Pacemaker MCP之產能演算法 15
3.1.4 MCP對當機的設定 16
3.1.5 MCP的參數設定 17
3.2 規劃目標 18
3.3 最大產能與最小批量允諾生產週期時間的求算 18
3.3.1 最大產能的求算 19
3.3.2 最小批量允諾生產週期時間的訂立 23
第四章 研究方法 27
4.1 異常等待時間的求算 27
4.2 異常等待時間為導向之派工法則 28
4.2.1 RCR派工法則 29
4.2.2 MCR派工法則 30
4.3 績效評估準則 33
第五章 實例驗證 34
5.1環境假設 34
5.2 研究基本假設 35
5.3 派工法則的比較 35
5.4 模擬驗證 36
5.5 結果分析 40
5.6 模擬驗證時間比較 42
第六章 結論與未來研究方向 43
6.1 結論 43
6.2 未來研究方向 43
參考文獻 45
附錄A: Pacemaker MCP相關設定 48
A.1 機台可用率的設定 48
A.2 時間區段(Time Bucket)的設定 48
A.3 寬裕時間(Slack Time)的設定 50
附錄B: 瓶頸派工MSEC2 52
B.1 派工定義[16] 52
B.2 b、 k值的求算 52
B.3 WR值的求算 53
附錄C:工作站資料 54
[1] J. H. Blackstone, Jr., D. T. Philips, and D. L. Hogg, ”A state-of-the-art survey of dispatching rules for manufacturing job shop operations,” International Journal of Production Research, vol. 25, pp. 1143-1156, 1982
[2] Y. Chang, T. Sheyoshi, and R. S. Sullivan, “Ranking dispatching rules by data envelopment analysis in a job shop environment,” IIE Transactions, vol. 28, pp. 631-642, 1996
[3] J. R. Jackson, “Simulation research on job shop production,” Naval Research Logistic Quarerly, vol. 14, pp. 287-295, 1957
[4] K. Wroblewski and R. Krawczynski, “Priority rules in production flow control,” Material Flow, vol.2, pp.167-177, 1985
[5] L. M. Wein, “Scheduling semiconductor wafer fabrication,” IEEE Transactions on Semiconductor Manufacturing, vol. 1, pp. 115-130, 1988
[6] S. H. Lu and P. R. Kumar, “Distributed scheduling based on due dates and buffer priorities,” IEEE Transactions on Semiconductor Manufacturing, vol. 36, pp.1406-1416, 1991
[7] S. H. Lu, D. Ramaswamy, and P. R. Kumar, “Efficient scheduling policies to reduce mean and variance of cycle-time in semiconductor manufacturing plants,” IEEE Transactions on Semiconductor Manufacturing, vol. 7, pp. 374-388, 1994
[8] R. S. Russell, E. M. Dar-El, and B. W. Taylor Ⅲ, “A comparative analysis of the COVERT job sequence rule using various shop performance measure,” International Journal of Production Research, vol. 25, pp. 1523-1540, 1987
[9] A. P. J. Vepsalainen and T. E. Morton, “Priority rules for job shops with weighted tardiness costs,” Management Sciences, vol. 33, pp. 1035-1047, 1987
[10] D. J. Van Der Zee, A. Van Harten, and P. C. Schuur, “Dynamic job assignment heuristics for multi-server batch operations ─A cost based approach,” International Journal of Production Research, vol. 35, pp. 3063-3093, 1997
[11] J. D. C. Neuts, “A general class of bulk queue with poisson input,” Annals Mathematical Statistics, vol. 38, pp. 759-770, 1967
[12] W. W. Weng and R. C. Leachman, “An improvement methodology for real-time production decision at batch-process workstations,” IEEE Transactions on Semiconductor Manufacturing, vol. 6, pp. 219-225, 1993
[13] C. R. Glassey and W. W. Weng, “Dynamic batching heuristic for simultaneous processing,” IEEE Transactions on Semiconductor Manufacturing, vol. 4, pp. 77-82, 1991
[14] J. W. Fowler, D. T. Philips, and D L. Hogg, “Real-time control of multi-product bulk-service semiconductor manufacturing process, ” IEEE Transactions on Semiconductor Manufacturing, vol. 5, pp. 158-163, 1992
[15] J. K. Robinson, J. W. Fowler, and J. F. Bard, “The use of upstream and downstream information in scheduling semiconductor batch operations, ” International Journal of Production Research, vol. 33, pp. 1849-1869, 1995
[16] Y. D. Kim, J. U. Kim, S. K. Lim, and H. B. Jun, “Due-date based scheduling and control policies in a multiproduct semiconductor wafer fabrication facility,” IEEE Transactions on Semiconductor Manufacturing, vol. 11, pp. 155-164, 1998
[17] J. Errington, “Advanced planning and scheduling (APS): a powerful emerging technology,” IEE Colloquium on Next Generation I.T. in Manufacturing, pp. 3/1-3/6, 1997
[18] 溫伊蓁,「晶圓製造廠目標導向型生產活動控制系統之設計」,交通大學工業工程與管理系碩士論文(1999)
[19] 周煜智,「晶圓製造廠多工單等級之生產活動控制系統設計」,交通大學工業工程與管理系碩士論文(2000)
[20] 吳宏祥,「晶圓代工廠多種生產週期時間產品之精確產能規劃與快速接單機制」,交通大學工業工程與管理系碩士論文,(2000)
[21] http://www.paragonms.com/
[22] http://www.autosim.com
[23] http://www.tecnomatix-unicam.com.sq
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top