...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Intelligent Information Management >Design and Comparison of Simulated Annealing Algorithm and GRASP to Minimize Makespan in Single Machine Scheduling with Unrelated Parallel Machines
【24h】

Design and Comparison of Simulated Annealing Algorithm and GRASP to Minimize Makespan in Single Machine Scheduling with Unrelated Parallel Machines

机译：无关联并行机单机调度中模拟退火算法与GRASP最小化设计的比较

获取原文
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

This paper discusses design and comparison of Simulated Annealing Algorithm and Greedy Randomized Adaptive Search Procedure (GRASP) to minimize the makespan in scheduling n single operation independent jobs on m unrelated parallel machines. This problem of minimizing the makespan in single machine scheduling problem with uniform parallel machines is NP hard. Hence, heuristic development for such problem is highly inevitable. In this paper, two different Meta-heuristics to minimize the makespan of the assumed problem are designed and they are compared in terms of their solutions. In the first phase, the simulated annealing algorithm is presented and then GRASP (Greedy Randomized Adaptive Search procedure) is presented to minimize the makespan in the single machine scheduling problem with unrelated parallel machines. It is found that the simulated annealing algorithm performs better than GRASP.
机译：本文讨论了模拟退火算法和贪婪随机自适应搜索程序（GRASP）的设计和比较，以最大程度地减少在m个无关并行机上调度n个独立于操作的作业的时间。在具有统一并行机的单机调度问题中最小化制造期的问题是NP难题。因此，对于这样的问题进行启发式开发是不可避免的。在本文中，设计了两种不同的元启发式方法，以最大程度地减少假定问题的有效期，并根据解决方案进行比较。在第一阶段，提出了模拟退火算法，然后提出了GRASP（贪婪随机自适应搜索过程），以最大程度地减少与并行机器无关的单机调度问题中的制造时间。发现模拟退火算法的性能优于GRASP。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号