塔布搜尋法在塑化業排程之應用-以BOPP FILM為例

Applying TABU Search Method in the Scheduling of Plastic & Chemical Industry-Example of BOPP FILM

陳正雄(Cheng-Hsiung Chen)

指導教授 ： 張百棧

元智大學/工程學院/工業工程與管理學系/碩士(2000年)

摘要

本研究主要是探討塔布搜尋法(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.

並列關鍵字

TABU search ； non-identical parallel machine ； muti-criteria

參考文獻

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.