首页> 外文期刊>Mathematical Problems in Engineering >Particle Swarm Optimization Algorithm for Unrelated Parallel Machine Scheduling with Release Dates
【24h】

Particle Swarm Optimization Algorithm for Unrelated Parallel Machine Scheduling with Release Dates

机译:带有发布日期的无关并行机器调度的粒子群优化算法

获取原文
获取原文并翻译 | 示例
           

摘要

We consider the NP-hard problem of minimizing makespan for n jobs on m unrelated parallel machines with release dates in this research. A heuristic and a very effective particle swarm optimization (PSO) algorithm have been proposed to tackle the problem. Two lower bounds have been proposed to serve as a basis for comparison for large problem instances. Computational results show that the proposed PSO is very accurate and that it outperforms the existing metaheuristic.
机译:在本研究中,我们考虑了具有发布日期的m个无关的并行计算机上的n个作业的使制造期最小化的NP难题。已经提出了一种启发式且非常有效的粒子群优化(PSO)算法来解决该问题。已经提出了两个下界作为比较大型问题实例的基础。计算结果表明,所提出的粒子群优化算法非常准确,并且优于现有的元启发式算法。

著录项

  • 来源
    《Mathematical Problems in Engineering》 |2013年第1期|409486.1-409486.9|共9页
  • 作者

    Yang-Kuei Lin;

  • 作者单位

    Department of Industrial Engineering and Systems Management, Feng Chia University, P.O. Box 25-097, Taichung 40724, Taiwan;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号