中文摘要：

根据制衣企业染整车间实际需求，建立了染缸加工的调度模型。该模型与传统调度模型不同，它既考虑了小作业的合并，也考虑了大作业的拆分，并在最小化总拖期的同时提高了染缸利用率。改进了已有的启发式算法，使之能够求解本问题，同时提出了一种新的启发式算法。利用某制衣企业染整车间实际生产数据，测试和分析了所提算法的可行性，结果表明新启发式算法既能减小作业总拖期，还可有效提高染缸利用率。

英文摘要：

Based on actual requirements of the dyeing and finishing workshop in the cloth making factory, the scheduling model for dyeing machine was constructed. Being different from traditional scheduling models, the proposed model considered not only the merge of small jobs but also the decomposition of large jobs. Aims of the proposed model were to minimize the total tardiness and maximize the average utilization of dyeing machines simultaneously. An existing heuristic algorithm was improved and a new heuristic algorithm was proposed to solve the dyeing scheduling problem. All the proposed algorithms were applied in real-life data from the dyeing and finishing workshop in a typical cloth-making factory in Beijing. Results showed that the proposed algorithm could not only minimize the to tal tardiness but also enhance the utilization of dyeing machines.