Heuristic Dispatching Algorithms for Yarn Dyeing Process

• Main Authors: Jen-Yao Tsai, 蔡仁耀
• Other Authors: Hsi-Mei Hsu
• Format: Others
• Language: zh-TW
• Published: 2004
• Online Access: http://ndltd.ncl.edu.tw/handle/53866979965523860861

碩士 === 國立交通大學 === 工業工程與管理系所 === 92 === This research proposes three heuristic dispatching algorithms（Simulated annealing ,Genetic algorithms ,Tabu search）for the dyeing process in a yarn-dyed textile factory. The performances of these algorithms are verified by a real case. Special characteristics of the yarn-dyed textile industry, that have been taken into account in the development of the dispatching algorithms for dyeing process, are the following: (1) the set-up times of the dyeing machine are dependent on the sequence of jobs on the machine; (2) the tardiness of a job is dependent on the other jobs which are included in a particular pattern of customer order. The second characteristic is called “grouping delivery” The performances of three proposed algorithms have been compared with those of the traditional dispatching methods (EDD, SPT, CR), and have shown better results. Among the three proposed heuristic dispatching algorithms, Simulated annealing and Tabu search have better performances and have less computation time than Genetic Algorithms.