簡易檢索 / 詳目顯示

研究生: 許浚鳴
Hsu, Chun-Ming
論文名稱: 封裝廠植球區之雙機台排程模式
Scheduling model of dual machines for solder ball mount process of semiconductor assembly plant
指導教授: 張行道
Chang, Shing-Tao
學位類別: 碩士
Master
系所名稱: 工學院 - 工程管理碩士在職專班
Engineering Management Graduate Program(on-the-job class)
論文出版年: 2005
畢業學年度: 93
語文別: 中文
論文頁數: 76
中文關鍵詞: 生產管理生產排程封裝廠排程法則雙機台排程演算法
外文關鍵詞: production scheduling, dual machine scheduling, assembly plant, BGA., algorithm, production management, rules of scheduling
相關次數: 點閱:81下載:7
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  •   封裝業在半導體產業供應鏈中扮演重要角色,為符合客戶需求,在品質、交期上必定要更具競爭力,在有限生產規模下,生產線的規劃、變更調整變得非常重要。本研究以BGA系列產品封裝廠植球區如何提升生產效率為主題,探討為符合多元化產品、顧客需求量、生產週期、及機器環境與能力,分析並建立適當的排程模式,使人員、設備、品質及產能有最佳組合。
      研究建立以產品為導向之雙機台排程模式,以產品種類及作業複雜度作為機台負荷分類基礎,參考最近出貨產品種類,替每一客戶的固定接腳產品,平均建立在二台植球機上,避免重複性生產訂單發生等待,讓每一種產品在植球機有固定作業路徑。同時封裝廠為使資源充分應用,面對少量多樣產品需求,彙整多家接腳數相近產品在同一機台,讓產能堆疊達機台最大能力。在植球機上有固定規則依循,配合先進先出、最短加工時間優先方法,讓植球區排程保持最佳彈性。最後以實證方式,將本排程模式導入生產線,確認排程模式運作情形。
      實證過程中說明排程觀念在植球區製造現場演變的重要性。就植球區作業管理來看,排程不能僅專注在產量及時間因素,需有更多的考量如產品特殊規格需求、機器環境與機器能力、及產品多元特性。面對這些製造要素,本研究排程模式應用於BGA產品植球區,帶來幾項優勢:(1)減少機台作業程式管理,(2)縮短換模時間,(3)提昇生產週期達成率,(4)對產能波動具有穩定效果,(5)改善機台換模造成子批生產週期異常,(6)每種產品有固定作業路徑。

      Assembly plays an important role in the supply chain of semiconductor industry. In order to conform the requirements of customers, it is competitive on quality and delivery time. It has becoming more and more important to plan and modify production line under restricted production scale. This research focuses on how to raise production efficiency for BGA (Ball Grid Array) products at solder ball mount process of an assembly plant. In responding to the diversified products, demands of customers, production cycle time, and machine environment, this study analyzes and establishes a applicable scheduling model to form a better mix for staffs, facilities, quality, and capacity.
      In the product oriented scheduling model for dual machines, the loads of machines are classified according to the product types and the production complexity. Two machines are based for every pin count product in the solder ball mount process to avoid waiting of repeat orders and let the same type of product have the same path. At the same time, to make fully use of the resources and face diversified products, the products of similar pin counts are arranged in the same machine to reach the machine’s capacity. The solder ball mount process is scheduled to follow the first in first out (FIFO), and shortest processing time first (SPTF) rules to keep flexibility. At last, the scheduling model is tested on real production lines.
      The test shows that the developed scheduling model for dual machines of BGA products has the following advantages: (1) reduced numbers of programs for machines, (2) shortened mold change time, (3) completion in cycle time, (4) less fluctuated output, (5) improved cycle time deviation, and (6) fixed operating path for every product.

    摘 要                        I Abstract                     II 目 錄                       III 圖目錄                        VI 表目錄                       VII 第一章 緒論                     1  1.1 研究動機                   1  1.2 研究目的                   2  1.3 研究流程 2  1.4 研究範圍與限制 3 第二章 封裝廠生產線作業與排程              5  2.1 IC封裝作業流程與特性            5   2.1.1 IC封裝作業流程             5   2.1.2 半導體封裝之特性            8   2.1.3 封裝廠作業現場特性            9  2.2 生產排程理論                11   2.2.1 生產排程                11   2.2.2 排程環境                12  2.3 IC封裝生產流程                15  2.4 封裝生產系統                17 第三章 植球區作業分析                19  3.1 作業現場問題                19  3.2 作業子批分割模式               22  3.3 產品轉換週期時間                22  3.4 各產品模具配置                24  3.5 產品需求狀況                26  3.6 植球機換模效率                29 第四章 植球區排程模式                34  4.1 理論背景                  34   4.1.1 基本動線                34   4.1.2 排程作業規則                35   4.1.3 雙機台排程建構背景           37  4.2 產品排程                  38   4.2.1 主排程與主生產排程           38   4.2.2 日程安排與現場控制           39  4.3 派工規劃                  39  4.4 產品雙機台排程方法                44  4.5 理論觀點比較                49 第五章 實例應用                 52  5.1 實例應用設計                52  5.2 產能規劃                  54  5.3 植球區設備規模與排程            56   5.3.1 植球區資料與作業            56   5.3.2 現有排程觀點與缺失           56  5.4 植球區機台調整                 57   5.4.1 植球機產品配置             57   5.4.2 植球區換模               60   5.4.3 植球區時間損失比率           62  5.5 產能波動                  63   5.5.1 每日產能波動               64   5.5.2 每週產能波動               65   5.5.3 每月產能波動               66  5.6 波動時間週期分析               66  5.7 生產週期差異分析               67  5.8 雙機台排程優點               68 第六章 結論與建議                 70  6.1 結論                   70  6.2 建議                   72 參考文獻                       73

    一、中文部份
    1. 大野耐一,「豐田生產方式與現場管理」,日本能率協會,中華企業管理發展中心,民
    70。
    2. 田國興,「有設置時間之流程型工廠多階段平行機台總排程時間最小化問題」,中原大
    學工業工程研究所碩士論文,民89。
    3. 李昇芳,「半導體封裝之混線生產研究」,逢甲大學工業工程研究所碩士論文,民88。
    4. 李嘉柱,李佳穎,「半導體後段廠之現場生產流程與作業管制條件分析辦法探討」,機
    械工業雜誌,12月,pp.109-115,民88。
    5. 李晉裕,「半導體測試廠有限資源產能規劃研究」,中原大學工業工程學系碩士論文,
    民89。
    6. 李榮貴等,「現場流程資料模式的建構與應用—以半導體封裝業在製品管制系統為
    例」,中華管理評論,Vol.2, No.5, p.1-24,民88。
    7. 宋身元,楊麗青,「淺談排程系統設計之相關要素」,機械工業雜誌,12月,
    PP.233-239,民82。
    8. 李友錚,「作業管理:創造競爭優勢」-二版修訂,前程企業,台北,民92年8月。
    9. 林龍欽,「現場流程資料模式的建構與應用--以半導體封裝在製品管制系統為例」,
    交通大學工業工程與管理研究所博士論文,民89。
    10. 張盛鴻,「生產計畫與管理」-二版修訂,高立圖書,台北,民87。
    11. 張保隆,陳文賢,蔣明晃,姜齊,盧昆宏,王瑞深,「生產管理」-二版,華泰,台
    北,民89。
    12. 黃宏文,「具製程規格能力機台之負荷分配」,Journal of the Chinese institute
    of industrial engineers, Vol.18, No.4, pp.82-96, 2001
    13. 賴士葆,「生產/作業管理:精要與個案」,華泰書局,民80年2月。
    14. 傅和彥,「生產與作業管理」—三版,前程企業管理有限公司,台北,民88。
    15. 日月光半導體公司製造八廠製二部作業現場訪談,2004。
    二、西文部份
    1. Adam, F., Fahy, T. and Murphy, C. (1998), “A framework for the classification of DSS usage across organizations “, Decision Support System, 22, 1-13.
    2. Adler, L., Fraiman, N., Kobacker, E., Pinedo, M., Plotnicoff, J., C., and Wu, T., P. (1993), “BPSS : A scheduling support system for the packaging industry”, Operations Research, Vol.41, No.4, 641-648.
    3. Ahmadi, R. H., and Matsuo, H. (2000), “A mini-line approach for pull production “, European Journal of Operations Research, 125, 340-358.
    4. Azizoglu, M., and Kirca ,O. (1999), “On the minimization of total weighted flow time with identical and uniform parallel machines”, European Journal of Operational Research, Vol.113, 91-100.
    5. Dannenbring, D. G. (1977), “An evaluation of flow shop sequencing heuristics”, Management Science, Vol.23, No.11, 1174-1182.
    6. Friscia, A., and Baer, A. (1994), “MES: Missing Link,” InTech, Vol. 41, No. 5, 20-23.
    7. Glassey, C. R., and Resende, M. G. C. (1988), “Closed- loop Jop shop Release Control for VLSI Circuit Manufacturing”, IEEE Transactions on Semiconductor Manufacturing, Vol.1, No.1, 26-46.
    8. Graves, S. C. (1983), ”Scheduling of Re-Entrant Flow Shops“, Journal of Operations Management, Vol.3, No.4, 197-207.
    9. Gupta, J. N. D. (1971), “A functional heuristic algorithm for the flowshop scheduling program”, Operational Research Quarterly, Vol.22, No.1, 39-47.
    10. Gupta, J. N. D., and Tung, E. A. (1991), “Schedules for a two-stage hybrid flowshop with parallel machines at the second stage”, INT.J.PROD.RES., Vol.29, No.7, 1489-1502.
    12. Hakanson and Bill (1996), “Manufacturing Execution Systems: Where’s the Payoff ?”, I&CS, March, 47-50.
    13. Hastings, N. A. J., and Yeh, C. H. (1992), "Bill of manufacturing", Production and Inventory Management Journal, Fourth Quarter, 27-31.
    14. Hundal, T. S., and Rajgopal, J. (1988), “An extension of Palmer’s heuristic for the flow shop scheduling problem”, INT.J.PROD.RES., Vol.26, 1119-1124.
    15. Kochhar, S., and Morris, R. J. T. (1998), “Heuristic methods for flexible flow line scheduling”, Journal of Manufacturing System, Vol.6, No.4, 299-314.
    16. Kovalyov, M. Y., and Shafransky, Y. M. (1997), “Batch scheduling with deadlines on parallel machines : An NP-hard case “, Information Processing Letters, Vol.64, 69-74.
    17. Lou, S. X. C., and Kager, P. W. (1989), “A Robust Production Control Policy for VLSI Wafer Fabrication”, IEEE Transaction on Semiconductor Manufacturing, Vol.2, No.4, 159-164.
    18. Lu, S. C. H., Ramaswamy, D., and Kumar, P. R. (1994), “Efficient Scheduling Policies to Reduce Mean and Variance of Cycle-Time in Semiconductor Manufacturing Plants”, IEEE Transaction on Semiconductor Manufacturing, Vol.7, No.3, 374-388.
    19. Mandel, M., and Mosheiov, G. (2001), “Minimizing maximum earliness on parallel identical machines”, Computers and Operations Research, Vol.28, 317-327.
    20. Melnyk, S. A., Carter, P. L., Dilts, D. M. and Lyth, D. M. (1985), Shop Floor Control, Dow Johns – Irwin, Homewood, Illinois.
    21. MESA International (1997), “MES Functionalities & MRP to MES Data Flow Possibilities,” White Paper No.2.
    22. MESA International (1995), “The Controls Layer:Controls Definition & MES to Controls Data Flow Possibilities,” White Paper No. 3.
    23. Moder, J. J., Philips, C. R., and Davis, E. W. (1983), Project Management with CPM, PERT and Precedence Diagramming. 3rd Edition, Van Nostrand Reinhold, NY.
    24. Morton, T. E., and Pentico, D. W. (1993), “Heuristic Scheduling System with Application to Production Systems and Project Management.”
    25. Nowicki, E., and Smutnicki, C. (1998), “The flow shop with parallel machines : A Tabu search approach”, European Journal of Operational Research, Vol.106, 226-253.
    26. Piersma, N., and Vam Dijk, W. (1996), “Local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search.”, Mathematical and Computer Modeling, Vol.24, No.9, 191-194.
    27. Pinedo, M., and Lee, Y. H. (1997), “Scheduling jobs on parallel machines with sequence-dependent setup times”, European Journal of Operation Research, Vol.100, 69-74.
    28. Pillutla, S. N., and Nag, B. N. (1996), ”Object-oriented model construction in production scheduling decisions” , Decision Support System, 18, 357-375.
    29. Richard J., and Tersine, A. (1985), Production Operations Management: Concepts Sucture and analysis, 2nd. ed. New York : North-Holland.
    30. Santo, D. L., Carpender, D. A., and Schniederjans, M. J. (1995), “Global lower bounds for flow shops with multiple processors”, European Journal of Operational Research, 80, 112-120.
    31. Santo, D. L., Carpender, D. A., and Schniederjans, M. J. (1996), “An evaluation of sequencing heuristics in flow shops with multiple processors”, Computers and Engineer, Vol.30, No.4, 681-692.
    32. Uzsoy, R., Church, L. K., and Ovacik, I. M. (1992), “Dispatching Rules for Semiconductor Testing operations : A computational Study”, Thirteenth IEEE/CHMT International, 272-276.
    33. Weng, W. W., and Leachman, R. C. (1993), “An Improvement Methodology for Real-time Production Decision at Batch-process Workstations.”, IEEE Transactions on Semiconductor Manufacturing, Vol.6, No.3, 219-225.
    34. Wittrock, R. J. (1988), “An Adaptable scheduling algorithm for flexible flow lines”, Operations Research, Vol.36, No.3, 445-453.

    下載圖示 校內:立即公開
    校外:2005-07-29公開
    QR CODE