• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>International Journal of Innovative Computing Information and Control >NON-IDENTICAL PARALLEL MACHINE SCHEDULING WITH FUZZY PROCESSING TIMES USING ROBUST GENETIC ALGORITHM AND SIMULATION
【24h】

NON-IDENTICAL PARALLEL MACHINE SCHEDULING WITH FUZZY PROCESSING TIMES USING ROBUST GENETIC ALGORITHM AND SIMULATION

机译：鲁棒遗传算法和仿真的模糊加工时间非同等并行机调度

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

This paper addresses non-identical parallel machine scheduling problem with fuzzy processing times (FPMSP). A robust genetic algorithm (GA) approach embedded in a simulation model to minimize maximum completion time (makespan) is proposed. The results are compared with those obtained by using LPT rule, known as the most appropriate dispatching rule for such problems. This application illustrates the need for efficient and effective heuristics to solve FPMSPs. The proposed GA approach yields good results and reaches them fast and several times in one run. Moreover, due to its advantage of being a search algorithm, it can explore alternative schedules providing the same results. Thanks to the simulation model, several robustness tests are conducted using different random number sets and it has been shown that the proposed approach is robust.
机译：本文解决了具有模糊处理时间（FPMSP）的非相同并行机调度问题。提出了一种鲁棒的遗传算法（GA）方法，该方法嵌入在仿真模型中，以最大程度地减少最大完成时间（makespan）。将结果与使用LPT规则获得的结果进行比较，LPT规则是解决此类问题的最合适的调度规则。此应用程序说明了解决FPMSP的有效启发式方法的需求。拟议的遗传算法方法产生了良好的结果，并且一次运行即可多次快速达到目标。此外，由于其作为搜索算法的优势，它可以探索提供相同结果的替代计划。由于仿真模型，使用不同的随机数集进行了几种鲁棒性测试，结果表明所提出的方法是鲁棒的。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号