格子布染色工段多目標派工方法之探討

Abstract

染色工段的生產環境相當複雜，其特性如下：（1）不同缸型上的工單排程非獨立，會相互影響；（2）每張工單在不同的缸型加工，有不同的加工時間；（3）染缸的設置時間是順序相依；（4）每種缸型有多部相同染缸，不同缸型上的工單排程會相互影響。以最小化訂單加權延遲時間總和與訂單達交率最大化為目標，考慮上述排程特性，本研究銜接徐氏的工單缸型指派的整數規劃模式，以禁忌搜尋法發展一套多目標派工方法。 本研究以一實際工廠資料說明該多目標派工方法，將其績效與EDD派工法則及典型禁忌搜尋法比較，在訂單加權延遲時間總和與達交率上都有很好的績效。

This research presents a multi-objective dispatching algorithm for dyeing process in yarn-dyed textile. Special characteristics of the dyeing process are considered in the proposed algorithm as follows : (1) The setup times depend on item sequences; (2) The relationship among items must be considered in scheduling multiple unrelated parallel machines. The objectives of the multi-objective dispatching algorithm are to minimizing total weighted tardiness and to maximizing hit-rate. The sum of normalized total weighted tardiness and normalized hit-rate is defined as the fitness value in the Tabu search designed by this research to find a near optimal dispatching sequence for each machine type.The proposed algorithm is verified by a real case. The performances of the proposed algorithm has been compared with traditional dispatching method (EDD) and classic Tabu search. The results have shown that the performances of the proposed multi-objective dispatching algorithm are better than EDD and classic Tabu search.