| 研究生: |
李坤源 Lee kun-yuan |
|---|---|
| 論文名稱: |
以啟發式演算法解決三機流程式生產排程問題-以先豐通訊IC載板廠為例 Flowshop of three machines production scheduling improve research Using Meta-heuristics - for example Company BTK |
| 指導教授: | 葉英傑 |
| 口試委員: | |
| 學位類別: |
碩士 Master |
| 系所名稱: |
管理學院 - 工業管理研究所在職專班 Executive Master of Industrial Management |
| 論文出版年: | 2013 |
| 畢業學年度: | 101 |
| 語文別: | 中文 |
| 論文頁數: | 62 |
| 中文關鍵詞: | 限制理論 、非等效平行機台 、機台合適度 、啟發式演算法 |
| 相關次數: | 點閱:7 下載:0 |
| 分享至: |
| 查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報 |
本研究針對流程型、非等效平行機台、機台合適度、製程相依及製程獨立設置時間的生產排程問題進行探討並考量求解目標為 : 最小化加總成本(ΣCj)及加總絶對延遲時間。
本研究針對個案工廠實際的生產工單組合進行分析,先利用限制理論把全線的排程問題限縮在前段有製程設置時的三個工作站,再針對這三站的製程特性進行個別分析,再把問題範圍縮小到—非等效平行機台、有機台合適度、產能平衡、設置時間議題的綠漆工作站,為全線的產能瓶頸站,並利用限制驅導式排程及Permutation的觀念,以綠漆站的排程當做投料排程來簡化全線的生產排程問題。再利用Excel內建的啟發式演算法做求解的工具,但因Excel的限制再並需再將α= P2類型的排程先,以人工的方法將工單分成兩類使排程問題又從P2再簡化為1(1*2 , 1R / 1S)。
本研究先建構一個評估個案工廠排程績效的數學模式,運用個案實際的工單資料為測試基礎,再以SPT、EDD、LST三種派工法則及個案現行的人工排程方法與Excel內建的啟發式演算法,做排程績效之評估比較,結果發現Excel內建的啟發式演算法在換線成本項目的績效上有10 ~ 43% 的提昇,但在加總絶對延遲時間項目的改善上則不顯著。
This study explores the production scheduling problems of Floor Shop, Unrelated Parallel Machine, Machine Eligibility, Sequence Dependent Setup Time and Sequence Independent Setup Time and also attempts to solve the following research question: the minimization of ΣCj & ΣTj.
This study also analyzes the combinations of run card in the case-study factory through the following procedures. First, confine the problems of the whole workstations scheduling to the three working stations with anterior section of having setup time process by means of TOC. Next, implement the independent analysis of the process feature in these three stations, and then further restrict the problems to a certain Solder musk working station, featuring Unrelated Parallel Machine, Machine Eligibility, Balance of Capacity and Setup Time Issue, which is the bottleneck station in the production line. Then, with the concept of D-B-R, simplify the problems of production scheduling in the whole line by assimilating the scheduling in Solder musk station into goods issue scheduling. Finally, use the Meta-heuristics built in the Excel as the means of instruments.
This study begins with a mathematical module to evaluate the performance of effects in the case-study factory and uses the authentic data of run card as the test foundation. Then, activate the comparison of performance of effects by means of three Dispatching Rules – SPT, EDD, and LST, artificial scheduling, as well as the Meta-heuristics built in the Excel. The result demonstrates 10 to 43 percent of improvement in the item of cost of setup calculated by the Meta-heuristics built in the Excel. However, there is no significant improvement in the item of ΣTj.
參考文獻
一.中文部份
[1] 王相弼,蔡志宏,李榮貴,張清亮,「以DBR模式構建記憶體晶圓針測廠之生產排程」,健康與管理學術研討會,(2008) 。
[2] 吳秉威 「以遺傳演算法求解PCB廠生產排程問題」,南台科技大學 ,工業管理研究所,碩士論文,(2005) 。
[3] 吳鴻輝,李榮貴,限制驅導式現場排程與管理技術,全華科技圖書股份有限公司,(2000) 。
[4] 沈國基 ,呂俊德,王福川,進階ERP企業資源規劃-運籌管理,前程文化,(2006) 。
[5] 邱智琳,「具有限資源及整備時間與交期限制之平行機台排程問題」,明志科技大學,工業工程與管理究所,碩士論文,(2012) 。
[6] 洪浩翰,「具順序相依設置時間與非固定序列特性之流程式製造單元排程」,國立交通大學業程與管理學系,碩士論文,( 2000) 。
[7] 高德拉特 (Eliyahu M. Goldratt)著,目標-簡單而有效的常識管理,齊若蘭譯,天下文化,台北,(1997) 。
[8] 高德拉特 (Eliyahu M. Goldratt)著,絕不是靠運氣,周怜利譯,天下文化,台北,(1997) 。
[9] 高德拉特 (Eliyahu M. Goldratt)著,關鍵鏈-TOC式專案管理,羅嘉穎譯,天下文化 ,台北,(2002) 。
[10] 莊銘洲,「生產排程應用之實證研究, 國立台灣科技大學,工業管理系,博士論文,(2009) 。
[11] 傑克基德&詹姆斯克列門(Jack Gido & James P. Clements)著,專案管理,宋文娟&黃振國譯,滄海書局,(2001) 。
二.英文部份
[12] Armentano, Vinicius A. and Debora P. Ronconi, “Tabu Search for Total Tardiness Minimization in Flowshop Scheduling Problems”, Computers & Operations Research, Vol.26, pp.219-235 (1999)。
[13] Baker, K.R. Introduction to Sequencing and Scheduling. Wiley, New York (1974)。
[14] Cheng, T.C.E. and C.C.S SIN, “A State-of -the-Art Review of Parallel-Machine Scheduling Research”, European Journal of Operational Research 47, pp. 271-292 (1990)。
[15] Garey MR. Johnson DS, Sethi R ,“The complexity of flow-hop and job-shop scheduling”, Math Oper Res Vol.1 pp. 117-129, (1976)。
[16] Graves, Stephen C., “A Review of Production Scheduling”, Operations Research Vol.29, No. 4, (1981)。
[17] Holland, J. H., Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor (1975)。
[18] Malandraki, C. and Daskin, M. S. (1993).“The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem”, European Journal of Operational Research, Vol. 65, pp. 218-34 (2006)。
[19] Rasmus Rasmussen, TSP in Spreadsheets: A Guided Tour, Molde University College, pp.94-116 (2011)。
[20] Schragenheim, E., and Rozen, B., “Drum-Buffer-Rope Shop Floor Control”, Production and Inventory Management Journal, Third Quarter , pp.18-23, (1990)。
[21] Sirikrai V., and Yenradee P., “Modified drum-buffer-rope scheduling mechanism for a non-identical parallel machine flow shop with processing-time variation”, International Journal of Production Research, Vol. 44, No. 17, pp. 3509-3531, (2006)。