首页 | 本学科首页   官方微博 | 高级检索  
     

染整车间染缸优化调度算法研究
引用本文:金锋,宋士吉,杨建华,吴澄.染整车间染缸优化调度算法研究[J].计算机集成制造系统,2008,14(3):543-547.
作者姓名:金锋  宋士吉  杨建华  吴澄
作者单位:清华大学,自动化系,北京,100084
基金项目:国家重点基础研究发展计划(973计划) , 国家自然科学基金
摘    要:根据制衣企业染整车间实际需求,建立了染缸加工的调度模型。该模型与传统调度模型不同,它既考虑了小作业的合并,也考虑了大作业的拆分,并在最小化总拖期的同时提高了染缸利用率。改进了已有的启发式算法,使之能够求解本问题,同时提出了一种新的启发式算法。利用某制衣企业染整车间实际生产数据,测试和分析了所提算法的可行性,结果表明新启发式算法既能减小作业总拖期,还可有效提高染缸利用率。

关 键 词:染缸优化调度  并行批处理机  不相容作业组  启发式算法

Dyeing machine scheduling problem in dyeing & finishing workshop
JIN Feng,SONG Shi-ji,YANG Jian-hua,WU Cheng.Dyeing machine scheduling problem in dyeing & finishing workshop[J].Computer Integrated Manufacturing Systems,2008,14(3):543-547.
Authors:JIN Feng  SONG Shi-ji  YANG Jian-hua  WU Cheng
Affiliation:JIN Feng,SONG Shi-ji,YANG Jian-hua,WU Cheng(Department of Automation,Tsinghua University,Beijing 100084,China)
Abstract: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 algorit...
Keywords:dyeing machine scheduling problem  parallel batch processing machine  incompatible job families  heuristic algorithm  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号