A GA methodology for the scheduling of yarn-dyed textile production

Hsi M. Hsu*, Yai Hsiung, Ying Z. Chen, Muh-Cherng Wu

*Corresponding author for this work

研究成果: Article同行評審

25 引文 斯高帕斯(Scopus)


This paper presents a scheduling approach for yarn-dyed textile manufacturing. The scheduling problem is distinct in having four characteristics: multi-stage production, sequence-dependent setup times, hierarchical product structure, and group-delivery (a group of jobs pertaining to a particular customer order must be delivered together), which are seldom addressed as a whole in literature. The scheduling objective is to minimize the total tardiness of customer orders. The problem is formulated as a mixed integer programming (MIP) model, which is computationally extensive. To reduce the problem complexity, we decomposed the scheduling problem into a sequence of sub-problems. Each sub-problem is solved by a genetic algorithm (GA), and an iteration of solving the whole sequence of sub-problems is repeated until a satisfactory solution has been obtained. Numerical experiment results indicated that the proposed approach significantly outperforms the EDD (earliest due date) scheduling method-currently used in the yarn-dyed textile industry.

頁(從 - 到)12095-12103
期刊Expert Systems with Applications
出版狀態Published - 1 十二月 2009

指紋 深入研究「A GA methodology for the scheduling of yarn-dyed textile production」主題。共同形成了獨特的指紋。