臺灣博碩士論文加值系統

本研究主要是探討塔布搜尋法(TABU Search)在塑化業排程的應用，並以Bi-Oxide Polypropylene (BOPP) FILM製程為例。BOPP FILM製程在塑化業是一個典型的非等效平行機排程問題，決策者為了達成系統績效之目標，滿足顧客的需求，除了要降低廢料成本 (Waste Material Cost) 之外，同時必須使延遲成本 (Tardiness Cost) 降低，在產品多樣少量的前提下，更增加了排程的困難。過去塔布搜尋法的相關文獻均針對單一目標做探討，較少同時考慮兩個或多個目標。本研究以廢料成本與延遲成本總和最小為評估準則，在相同的參數設定與訂單資訊的條件下，經由測試結果顯示，不管訂單交期如何分佈，同時考慮兩個目標比只考慮單一目標的結果較佳。本文所提之演算方法能夠迅速且有效的獲得較佳之可行解，與工廠實際排程比較平均有2%的改善率，能夠協助管理者執行排程相關之作業，因此具有實際應用之價值。

This paper mainly investigates the scheduling problems of the Plastic and Chemical industry by applying the TABU search. Especially, the case example of the BOPP FILM plant in production is applied to demonstrate the working theory of the scheduling problem. BOPP FILM manufacturing process is a classic scheduling problem in the non-identical parallel machine. In order to achieve the goal of the system efficiency and the customer satisfaction, the decision maker must not only reduce the wasting material cost, but also reduce the tardiness cost. Especially, in the make-to-order environment, the scheduling problem will be more difficult because various factors which are not under the assumptions will constantly interrupt the production processes. In the past, the papers all focus on the single criterion, but not in the multi-criteria. This paper considers the case of waste material and tardiness cost simultaneously. Under the same assumptions and environments, the results from this paper will derive a better result than the past. Since, these two cost functions can more practically represent the real words situation in application. After intensive experiments, applying this method to the real manufacturing can provide 2% improvement, approximately. So, this method can actually help shop manager to improve the schedule performance in practice.

書頁名
論文口試委員審定書
授權書
中文提要
英文提要
誌謝
目錄
表目錄
圖目錄
一、 緒論
1.1 研究背景與動機
1.2 研究目的
1.3 研究架構
二、 文獻探討
2.1 塔布搜尋法相關文獻
2.1.1 塔布搜尋法簡介
2.1.2 塔布搜尋法的組成要素
2.1.3 塔布搜尋法的演算步驟
2.2 平行機排程問題之相關文獻
三、 問題描述
3.1 工廠簡介
3.2 產品簡介
3.3 製程說明
3.4 BOPP FILM產能限制條件
3.5 BOPP FILM現行排程方式
3.6 問題定義
四、 研究方法
4.1 以塔布搜尋法求解產品在非等效平行機排程排程問題
4.1.1 塔布搜尋法參數設定
4.1.2 塔布搜尋法之執行
五、 實驗驗證
5.1 實驗目的
5.2 問題的產生
5.3 實驗方法
5.3.1 參數設定
5.3.2 實驗結果評估
5.4 差異分析
5.4.1 塔布搜尋法不同參數設定之比較
5.4.2 塔布搜尋法在不同起始解的比較
5.4.3 塔布搜尋法在不同變動方式取得鄰近解之比較
5.4.4 塔布搜尋法在不同目標與不同交期分佈狀況之比較
六、 結論
6.1 研究結論
6.2 未來展望
參考文獻

1. Armentano, V.A. and D.P. Ronconi, “Tabu Search for Total Tardiness Minimization in Flowshop Scheduling Problems,” Computers and Operations Research, 26, 219-235, 1999.
2. Barnes, J.W. and M. Laguna, “A Tabu Search Experience in Production Scheduling,” Annals of Operation Research, 41, 141-156, 1993.
3. Ben-Daya, M. and M. Al-Fawzan, “A Tabu Search Approach for the Flow Shop Scheduling Problem,” European Journal of Operational Research, 109, 88-95, 1998.
4. Geiger, C.D., K.G. Kempf and R. Uzsoy, “A Tabu Search Approach to Scheduling an Automated Wet Etch Station,” Journal of Manufacturing Systems, 16,102-116, 1997.
5. Glover, F., “Future Paths for Integer Programming and Links to Artificial Intelligence,” Computers and Operations Research, 13, 533-549, 1986.
6. Glover, F., “Tabu Search — Part I,” ORSA Journal Computing, 1, 190-206,1989.
7. Glover, F., “Tabu Search — Part II,” ORSA Journal Computing, 2, 4-32,1990.
8. Glover, F. and M. Laguna, Tabu Search, Blackwell Scientific Publications, Oxford, 1993.
9. Glover, F., Tabu Search Fundamentals and Uses,E-mail:glover_f@cubldr.Colorado.edu, 1994.
10. Glover, F. and M. Laguna, Tabu Search, Kluwer Academic Publishers, 1997.
11. Liaw, C.F., “A tabu Search Algorithm for the Open Shop Scheduling Problem,” Computers and Operations Research, 26, 109-126, 1999.
12. Moccellin, J.V. and M.S. Nagano, ” Evaluating the Performance of Tabu Search Procedures for Flow Shop Sequencing,” Journal of the Operational Research Society, 49, 1296-1302, 1998.
13. Nowicki, E. and C. Smutnicki, “The Flow Shop with Parallel Machines: A Tabu Search Approach,” European Journal of Operational Research, 106, 226-253, 1998.
14. Song, J.S. and T.E. Lee, “A Tabu Search Procedure for Periodic Job Shop Scheduling,” Computers &; Industrial Engineering, 30, 433-447,1996.
15. Wen, U.P. and I.C. Yeh, “Tabu Search Methods for the Flow Shop Sequencing Problem,” Journal of the Chinese Institute of Engineers, 20, 465-470, 1997.
16. 王立志, 系統化運籌與供應鏈管理, 滄海書局, 1999.