臺灣博碩士論文加值系統

塑膠早已廣泛應用於各種產品，尤其3C產品快速的發展，模具的開發速度便愈來愈受到重視；而模具製造排程屬於零工式排程問題，許多工廠早已採用工作站的方式，來增加整體產能。如果還使用傳統的單機排程方式，已經無法有效地利用生產資源，故應從平行機台的角度，妥善規劃排程與機台組態，減少模具製造時間與資源用量，才是增加企業競爭力的關鍵。
在工作站內會有許多平行機台，同樣工作可以有多部機台供選用，此狀況下如何選擇適當機台成為一大難題，本研究利用蟻群演算法的求解能力，建構以蟻群演算法為基礎的模具製造之平行機台排程系統，針對平行機台的特性，設計雙層的節點架構，讓螞蟻選擇製程節點後，再選擇機台節點，藉由費洛蒙的累積與蟻群系統三大法則的運作，能有效的安排工作至適當的機台。針對電極塊與放電加工的部份，加入節點篩選機制，設計多對一之節點架構，確保放電加工在電極塊製程之後。另外在機台配置方面，雖然增加機台數量能使排程調度更具有彈性，卻也增加了企業的成本，為了達到理想的機台組態，本研究搭配田口方法，將機台數量設定為控制因子，利用直交表來導出各因子的品質特性，其中影響較大的因子即為瓶頸機台，改變其水準值來得到較理想的完工時間，並進一步討論各設備的數量對製造排程的影響，評估工廠生產績效對於生產資源數量之關係。在製造排程引導流程系統的架構下，透過介面的操作來完成各參數的設定，並根據演算法的結果提供機台組態的建議值，提升機台的產能，最後的排程結果可輸出成甘特圖，並讓生管人員做最後的檢查與調度，使工廠的流程更為順暢。

Plastics are used in an enormous and expanding range of products, especially consumer electronics, mold development speed will be more and more important. Mold manufacturing schedules are more complex Job-shop Scheduling Problem. Many factories already adopted work stations to increase the overall production capacity. Still use conventional job-shop scheduling system that can be applied well to multi-stage, single machine producing mode is not an effective way to use production resources. Consider parallel-machine producing mode and make appropriate scheduling, effectively shorten the manufacturing time can enhance market competitiveness.
Same work can choose multiple machines, how to select appropriate machine under this condition is a big challenge. This research utilizes ant colony system with their exceptional searching and solving function to construct a modeling and scheduling system for mold manufacturing, parallel-machine. Design double node architecture, allowing ants to select process node, then choose the machine node, by the cumulative pheromone and three rules in ant colony system, effective arrangements jobs to the appropriate machine. As to electric discharge machining and electrode block, join node filter mechanism, design many-for-one node sequence architecture, ensure that the discharge machining process after electrode block process. In the machine configuration, increase the number of machines can make scheduling more flexible, but also increases the resource costs. In order to achieve the desired machine configuration, Taguchi method used in this study. The number of machine is set to control the factors, using orthogonal arrays to export quality characteristics of each factor, factors which affect the larger is the bottleneck machine, change its level to get better makepan. Further discuss the impact of the number of each machine manufacturing scheduling, assess the performance of the plant for the production relations of production quantity of resources. Under the guiding procedure for manufacturing systems, through the user interface to set the parameters, and provide recommendations based on the results of algorithm to enhance energy production machine. The results can be output to a scheduling gantt chart, allowing managers to do a final check and scheduling, the plant processes more smoothly.

目錄
摘要 I
Abstract II
致謝 III
目錄 IV
圖目錄 VI
表目錄 VIII
第一章 緒論 1
1-1 研究背景 1
1-2 文獻回顧 1
1-3 動機與目的 2
第二章 研究技術與背景 3
2-1 三層式網路架構 3
2-2 模具製造引導流程 4
第三章 蟻群系統演算法於平行機台排程最佳化 6
3-1 簡介 6
3-2 排程目標 6
3-3 排程問題解決法 6
3-3-1 派工法則 (Dispatching Rule) 7
3-3-2 啟發式演算法 7
3-4 平行機台排程 8
3-4-1 平行機台類型 8
3-4-2 多階平行機台排程 8
3-5 模具製造排程之條件限制 9
3-6 蟻群演算法 9
3-6-1 生物原理 9
3-6-2 蟻群系統 11
3-6-2-1 狀態轉移法則 13
3-6-2-2 區域更新法則 13
3-6-2-3 全域更新法則 14
3-7 應用於模具製程平行機台之蟻群系統優化 14
3-7-1 機台節點建構方式 14
3-7-1-1 距離參數 14
3-7-1-2 費洛蒙資料節構 15
3-7-2 問題建構 19
3-7-3 電極塊與放電加工製程 20
3-7-4 求解方法 21
3-8 應用於模具製造排程系統 25
第四章 機台組態優化 29
4-1 簡介 29
4-2 田口方法 29
4-3 與蟻群系統整合 29
4-4 與排程系統整合 36
第五章 結果與討論 39
5-1 群組蟻群排程系統介面 39
5-2 案例探討 40
5-2-1 製程規劃方式 40
5-2-2 模仁資料 40
5-3 測試結果 44
第六章 結論與未來展望 47
6-1 結論 47
6-2 未來展望 47
參考文獻 48
 
圖目錄
圖2-1 三層式架構 4
圖2-2 排程管理介面 5
圖3-1 真實螞蟻工作原理 11
圖3-2 蟻群系統流程圖 12
圖3-3 距離參數計算方式 15
圖3-4 工作站為基礎之費洛蒙資料結構 15
圖3-5 以製程順序為基礎之費洛蒙資料結構 16
圖3-6 基本節點為基礎之費洛蒙資料結構 16
圖3-7 群組蟻群系統流程圖 18
圖3-8 問題表示圖 19
圖3-9 放電加工問題表示圖 20
圖3-10 問題表示圖 22
圖3-11 範例一排程結果表示圖 23
圖3-12 範例二排程結果表示圖 23
圖3-13 範例一排程節結果 24
圖3-14 範例二排程節結果 24
圖3-15 零件製程標註 25
圖3-16 電極塊優先處理 26
圖3-17 電極塊設計 26
圖3-18 基本參數設定 27
圖3-19 案例選擇 27
圖3-20 機台數量設定 28
圖3-21 運算結果 28
圖4-1 L27點線圖與因子配置 32
圖4-2 因子反應圖 35
圖4-3 選擇直交表 36
圖4-4 機台組態完工時間趨勢圖 36
圖4-5 各組態的排程甘特圖 37
圖4-6 優化前的排程 38
圖4-7 優化後的排程 38
圖5-1 群組蟻群排程系統介面 39
圖5-2 已知最佳排程 40
圖5-3 手機前殼正反面 41
圖5-4 手機前殼模仁 41
圖5-5 手機後殼正反面 42
圖5-6 手機後殼模仁 43
圖5-7 FIFO排程結果 45
圖5-8 ACS排程結果 45
圖5-9 ACS_C排程結果 46
 
表目錄
表3-1 測試結果 17
表3-2 製程規劃表 19
表3-3 包含電極塊之製程規劃表 20
表3-4 製程加工機台對照表 22
表4-1 製程規劃表 29
表4-2 排程基本資料 30
表4-3 機台加工時間 30
表4-4 L27直交表 31
表4-5 實驗用L27直交表 33
表4-6 實驗結果數據 34
表4-7 因子反應表 34
表4-8 交互作用表 35
表4-9 實驗數據 37
表5-1 手機前殼模仁製程規劃表 41
表5-2 手機後殼模仁製程規劃表 43
表5-3 與先進先出比較 46
表5-4 與傳統蟻群系統比較 46

[1]Dorigo, M., Maniezzo, V. & Colorni, A. (1996). Ant System: Optimization by a Colony of Cooperating Agents. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, 26(1), 29-41.
[2]Dorigo, M. & Gambardella, L. M. (1997). Ant Colony System: a Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Transactions on Evolutionary Computation, 1(1), 53-66.
[3]Zhang, H., Gen, M. & Fujimura, S. (2004). Hybridizing Ant Colony Optimization with Dispatching Heuristics for Job-shop Scheduling Problem. Proceedings of the Fifth Asia Pacific Industrial Engineering and Management Systems Conference.
[4]Palmer, D.S. (1965). Sequencing Jobs Through a Multi-stage Procrss in the Minimun Total Time - A Quick Method of Obtaining a Near Optimum. Operational Research Quarterly, 16(1), 101-107.
[5]Gupta, J.N.D. (1971). A Functional Heuristic Algorithm for the Flow-shop Scheduling Problem. Operational Research Quarterly, 22(1), 39-47.
[6]Chou, Y. C. & Wu, C. S. (2002). Economic Analysis and Optimization of Tool Portfolio in Semiconductor Manufacturing. IEEE Transactions on Semiconductor Manufacturing, 15(4), 447-453.
[7]Chang, P. T., Lin, K. P., Pai, P. F., Zhong, C. Z., Lin, C. H. & Hung, L. T. (2008). Ant Colony Optimization System for a Multi-Quantitative and Qualitative Objective Job-Shop Parallel-Machine Scheduling Problem. International Journal of Production Research, 46(20), 5719-5759.
[8]Keskinturk, T., Yildirim, M. B. & Barut, M. (2012). An Ant Colony Optimization Algorithm for Load Balancing in Parallel Machines with Sequence-Dependent Setup Times. Computers & Operations Research, 39(6), 1225-1235.
[9]Behnamian, J., Zandieh, M. & Fatemi Ghomi, S. M. T. (2009). Due Window Scheduling with Sequence-Dependent Setup on Parallel Machines Using Three Hybrid Metaheuristic Algorithms. The International Journal of Advanced Manufacturing Technology, 44(7-8), 795-808.
[10]Tsai, J. T., Liu, T. K., Ho, W. H. & Chou, J. H. (2008). An Improved Genetic Algorithm for Job-Shop Scheduling Problems Using Taguchi-Based Crossover. International Journal of Advanced Manufacturing Technology, 38(9-10), 987–994.
[11]Moradi, E., Fatemi Ghomi, S. M. T. & Zandieh, M. (2010). An Efficient Architecture for Scheduling Flexible Job-Shop with Machine Availability Constraints. The International Journal of Advanced Manufacturing Technology, 51(1-4), 325-339.
[12]Jong, W. R., Wu, C. H., Liu, H. H. & Li, M. Y. (2009). A Collaborative Navigation System for Concurrent Mold Design. International Journal of Advanced Manufacturing Technology, 40(3-4), 215-225.
[13]Baker, R. K. (1984). Sequence Rules and Due-Date Assignments in a Job-Shop. Management Science, 30(9), 1093-1104.
[14]Brown, J. R. & Ozgur, C. O. (1977). Priority Class Scheduling：Product Scheduling for Multi-Objective Environment. Production Planning and Control, 8(8), 762-770.
[15]Panwalker, S. S. & Iskander, W. (1977). A Survey of Scheduling Rules. Operations Research, 25(1), 45-61.
[16]Blackstone, J. H., Jr, Phillips, D. & Hogg, G. L. (1982). A State-of-the-Art Survey of Dispatching Rules for Manufacturing Job-Shop Operations. International Journal of Production Research, 20(1), 27-45.
[17]Jain, A. S. & Meeran, S. (1998). A State-of-the-Art Review of Job-Shop Scheduling Techniques. Technical Report. Department of Applied Physics, Electronic and Mechanical Engineering University of Dundee.
[18]Baker, K. R. (1974). Introduction to Sequencing and Scheduling. New York, John Wiley & Sons.
[19]Nowicki, E. & Czeslaw, S. (1998). The Flow Shop with Parallel Machines：A Tabu Search Approach. European Journal of Operational Research, 106(2-3), 226-253.
[20]Sridhar, J. & Rajendran, C. (1993). Scheduling in a Cellular Manufacturing System：A Simulated Annealing Approach. International Journal of Production Research, 31(12), 2927-2945.
[21]Jacques C. & Ismaïl R. (1996). Two Branch and Bound Algorithms for the Permutation Flow Shop Problem. European Journal of Operational Research, 90(2), 238-251.
[22]Brah, S. A. & Hunsucker, J. L. (1991). Branch and Bound Algorithm for the Flow Shop with Multiple Processors. European Journal of Operational Research, 51(6), 88-99.
[23]Santos, D. L., Hunsucker, J. L. & Deal, D. E. (1995). Flowmult：Permutation Sequences for Flow Shops with Multiple Processors. Journal of Information and Optimization Sciences, 16(2), 351-366.
[24]Nawaz, M. (1983). A Heuristic Algorithm for the ‘M’ Machine, ‘N’ Job Flow-Shop Sequencing Problem. Management Science, 11(1), 91-95.
[25]Campbell, H. G., Dudek, R. A. & Smith, M. L. (1970). A Heuristic Algorithm for the n Job, m Machine Sequencing Problem. Management Science, 16(10), 630-637.
[26]Hundal, T. S. & Rajgopal, J. (1988) An Extension of Palmer’s Heuristic for the Flow-Shop Scheduling Problem. International Journal of Production Research, 26(6), 1119-1124.
[27]Taillard, E. (1993). Benchmarks for Basic Scheduling Problems. European Journal of Operational Research 64(2), 278-285.
[28]Liu, K. C. (1998). Dispatching Rules for Stochastic Finite Capacity Scheduling. Computers and Industrial Engineering, 35(1-2), 113-116.