首页> 中文期刊> 《计算机应用与软件》 >采用启发式算法求解多目标FJSP

采用启发式算法求解多目标FJSP

         

摘要

为了研究多目标柔性作业车间调度问题,基于甘特图和排积木经验分析,提出一种组合优先规则和基于此优先规则的启发式算法.组合优先规则面向完工时间、关键机床负荷和总负荷三个指标,改变规则中各数据项的比例可调整三个指标所占的比例.算法采用随机方式调整三个指标的比例,并微调最优解对应的比例,能随机产生多个高质量调度解.算法对比测试表明,算法求解质量更高,运行速度快且稳定,可直接用于在其他调度算法中产生初始解,或者用于动态调度.%To study multi-objective flexible job-shop scheduling problem,we analyse it based on Gantt graph and the experience of building block,and present a composite priority rule and a heuristic algorithm based on this rule.The composite priority rule is for three scheduling targets including the makespan,the key machine workload and the total workload.Changing the ratio of data items in the rule can modulate the ratio of three scheduling targets.The algorithm randomly adjusts the ratio of these three scheduling targets,and slightly regulates the ratio corresponding to the best solution,this can randomly generate a couple of excellent scheduling solutions.Contrasting test of the algorithm shows that the proposed algorithm is more excellent in solution quality,runs rapidly and steadily,and can be directly used in generating initial solution in other scheduling algorithms or used in dynamic scheduling.

著录项

相似文献

  • 中文文献
  • 外文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号