以模擬方法探討允許批量分割之非等效平行機台排程程序

Simulation of Uniform Parallel Machine Scheduling Procedures With Lot-Splitting

戴明哲(Ming-Che Tai)

指導教授 ： 吳國棟 ； 張玉鈍

國立臺北科技大學/管理學院/工業工程與管理研究所/碩士(2011年)

摘要

平行機台排程面臨新舊機器處理時間呈一比值之非等效平行機環境時，其工單在新舊機台之處理時間與機台設置時間成為工單派工時的選擇考量依據，允許批量分割有助於減少工單延遲時間，但須考量機台設置時間的增加。本研究以系統模擬建構非等效平行機台生產模型，針對平均機台設置時間、平均工單延遲時間、平均機台閒置時間三項績效指標提出一啟發式派工程序，並以工單處理時間為門檻將啟發式派工程序區分為NEW1、NEW2兩種派工方法。在工單批量抵達情境下，與降低延遲時間優先方法以及降低設置時間優先方法進行比較，並設計不同工單組合情境實驗之。實驗結果顯示，在210張共五個類型之工單排於15台新機器與15台舊機器之非等效平行機台環境時，此啟發式派工程序在三項績效指標皆有不錯且穩定之表現，多數情況下，其平均設置時間績效略低於降低設置時間優先方法，但明顯優於降低延遲時間優先方法；其平均延遲時間績效略低於降低延遲時間優先方法，但明顯優於降低設置時間優先方法。

關鍵字

非等效平行機 ； 系統模擬 ； 批量分割 ； 派工

並列摘要

When lot-splitting is applicable to schedule work orders on uniform parallel machines, job tardiness could be reduced while set-up time may increase. In this study, we construct simulation models for uniform parallel machine scheduling with proposed heuristic dispatching procedures to allow lot-splitting. Machine setup times, machine idle times and work order delay times as measurements are considered. The proposed procedures focus on how to schedule work orders to new machines or old machines, which we name it as machines with different speeds selection mechanism. The heuristic dispatching procedure is further classified as NEW1 dispatching procedure and NEW2 dispatching procedure base on work order processing time duration.
　　STF(setup time first) and DTF(delay time first) rules, which have good perfomance on machine setup times and order delay times, were utilized for comparison. When the proposed heuristic dispatching procedures, NEW1 and NEW2, are applied to an example of scheduling 210 work orders on 30 uniform parallel machines, the result shows that they have better and stable perfomance on average machine setup time, average machine idle time and average work order delay time in most experimental scenarios.

並列關鍵字

Uniform parallel machine ； Simulation ； Lot-splitting ； Dispatching

參考文獻

[1] 馮正廷，探討允許批量分割之等效平行機排程程序－以某成衣廠為例，碩士論文，國立臺北科技大學工業工程與管理研究所，2009。

[10] M. Pinedo, Scheduling theory, algorithms, and systems, 1995.

[11] P. Mellor, “A review of job shop scheduling,” Operational Research Quarterly, 1966, pp.161-170.

[12] Efraim Turban, Jay E. Aronson, and Ting-Peng Liang, Decision Support Systems and Intelligent Systems, 2006.

[13] S. Reiter, “A system for managing job shop production,” Journal of Business, vol. 34, 1966, pp.371-393.