簡易檢索 / 詳目顯示

研究生: 顏笠淵
Yen, Li-Yuan
論文名稱: 有效降低黃光區多機群生產週期時間之二階段派工法則
An Effective Two Stage Dispatching Rule for Cycle Time Reduction in Photolithography Area with Multi-Workstation
指導教授: 張國浩
Chang, Kuo-Hao
口試委員: 陳文智
簡禎富
學位類別: 碩士
Master
系所名稱: 工學院 - 工業工程與工程管理學系
Department of Industrial Engineering and Engineering Management
論文出版年: 2012
畢業學年度: 100
語文別: 中文
論文頁數: 29
中文關鍵詞: 黃光區派工法則負荷平衡模擬系統
外文關鍵詞: Photolithography, Dispatching rules, Workload balance, Simulation
相關次數: 點閱:1下載:0
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 一般來說,在半導體產業裡,平均生產週期時間是一項很重要的績效指標,如果能保持較低的週期時間,對於半導體廠有較好的競爭力。由於黃光區機台較其他製程機台昂貴許多以及黃光區的製程特性等原因,黃光區多大扮演著瓶頸站的角色,因此,若能降低黃光區的平均生產週期時間,相信可以提升半導體廠之競爭力。然而在許多現存的半導體廠每天需要處理許多不同種類的產品,因應產品種類的不同、製程技術需求的差異,所需要的機台型號與能力也不盡相同,為滿足產品需求,在黃光區中總有著許多種類的機台。因此,如何以較佳的派工方法,平衡各機器族間之負荷,減少升降溫所需要的前置時間,進而降低生產週期時間將是本篇考量之重點。本篇論文提出一二階段派工法則,在第一個階段,利用一個啟發式演算法處理機台負荷平衡的問題,在第二階段,利用最小前置時間的準則處理升降溫所造成的前置問題。經由實際資料之收集,建構出模擬系統,並透過模擬系統評估現有派工法則與建議派工法則績效指標之差異,經由數值比較之結果發現,在不同情境下分別有7%到10%的改善幅度。最後,我們根據三種情境下的模擬結果,進一步去了解生產週期時間與來到率及情境間的關係。


    In the semiconductor industry, mean cycle time is usually one of the key perfor-mance measures used by fabrication facilities to maintain their competitive advantage. As the machine in the photolithography area is more expensive than that in other areas, photolithography is usually a bottleneck area that significantly affects mean cycle time performance. Because of multiple production processes and their respective re-quirements and routings (e.g., precision requirements in alignment), multiple work-stations are present in photolithography areas. So, how to balance the workload among machines and how to reduce the setup time for changing the temperature groups are the important factors to reduce the mean cycle time. In this study, a two-stage dispatching rule for photolithography areas is proposed. In the first stage, a heuristic method for balancing workloads is developed, in which the machine with the lowest current and waiting workload is used. In the second stage, the heuristic rule is derived based on the concept of the smallest setup time for a sequence dependent setup time problem. Numerical studies show that with different scenarios, the two-stage dispatching rule can reduce the mean cycle time from 7% to 10% compared with cur-rent practice. Finally, according to the simulation result in different scenarios, we would discuss about the relationship among mean cycle time, arrival rate, and differ-ent scenarios.

    摘要 I Abstract II 誌謝辭 III 表目錄 V 圖目錄 VI 第一章、 緒論 1 1.1 研究背景與動機 1 1.2 研究目的 3 1.3 研究架構 3 第二章、 文獻探討 5 2.1 黃光區派工法則 5 2.2 平行機台派工法則 7 第三章、問題描述 9 3.1 問題描述 9 3.2 數學模型 13 3.3 模擬系統模型 16 第四章、派工法則 18 4.1 現場派工策略與分析 18 4.2 建議派工法則 20 第五章、模擬結果與分析 22 第六章、結論與未來研究方向 27 6.1 結論 27 6.2 未來展望 28 參考文獻 29

    1. A.T.H. Ang, A.I. Sivakumar, and C. Qi. Criteria selection and analysis for single machine dynamic on-line scheduling with multiple objectives and se-quence-dependent setups. Computers & Industrial Engineering, 56(4):1223-1231, 2009.
    2. R.M. Dabbas, H.N. Chen, J.W. Fowler, and D. Shunk. A combined dispatching criteria approach to scheduling semiconductor manufacturing systems. Comput-ers & industrial engineering, 39(3-4):307-324, 2001.
    3. S. Dunstall and A. Wirth. Heuristic methods for the identical parallel machine flowtime problem with set-up times. Computers & operations research, 32(9):2479-2491, 2005.
    4. Y.D. Kim, D.H. Lee, J.U. Kim, and H.K. Roh. A simulation study on lot release control, mask scheduling, and batch scheduling in semiconductor wafer fabrica-tion facilities. Journal of Manufacturing Systems, 17(2):107-117, 1998.
    5. H.H. Ko, J. Kim, S.S. Kim, and J.G. Baek. Dispatching rule for non-identical parallel machines with sequence-dependent setups and quality restrictions. Computers & Industrial Engineering, 59(3):448-457, 2010.
    6. K. Li and S. Yang. Non-identical parallel-machine scheduling research with minimizing total weighted completion times: Models, relaxations and algorithms. Applied mathematical modelling, 33(4):2145-2158, 2009.
    7. M.M. Liaee and H. Emmons. Scheduling families of jobs with setup times. In-ternational Journal of Production Economics, 51(3):165-176, 1997.
    8. DY Sha, SY Hsu, ZH Che, and CH Chen. A dispatching rule for photolithogra-phy scheduling with an on-line rework strategy. Computers & Industrial Engi-neering, 50(3):233-247, 2006.
    9. M.C. Wu, S.J. Chiou, and C.F. Chen. Dispatching for make-to-order wafer fabs with machine-dedication and mask set-up characteristics. International Journal of Production Research, 46(14):3993-4009, 2008.
    10. M.C. Wu, J.H. Jiang, and W.J. Chang. Scheduling a hybrid mto/mts semicon-ductor fab with machine-dedication features. International Journal of Production Economics, 112(1):416-426, 2008.
    11. G. Xue, O. Felix O_odile, H. Zhou, and M.D. Troutt. Integrated production planning with sequence-dependent family setup times. International Journal of Production Economics, 2011.

    無法下載圖示 全文公開日期 本全文未授權公開 (校內網路)
    全文公開日期 本全文未授權公開 (校外網路)

    QR CODE