• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>International Journal of Production Research >A novel hybrid meta-heuristic algorithm for a no-wait flexible flow shop scheduling problem with sequence dependent setup times
【24h】

A novel hybrid meta-heuristic algorithm for a no-wait flexible flow shop scheduling problem with sequence dependent setup times

机译：具有序列依赖建立时间的无等待灵活流水车间调度问题的新型混合元启发式算法

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

摘要

In this paper, we contemplate the problem of scheduling a set of n jobs in a no-wait flexible flow shop manufacturing system with sequence dependent setup times to minimising the maximum completion time. With respect to NP-hardness of the considered problem, there seems to be no avoiding application of metaheuristic approaches to achieve near-optimal solutions for this problem. For this reason, three novel metaheuristic algorithms, namely population based simulated annealing (PBSA), adapted imperialist competitive algorithm (AICA) and hybridisation of adapted imperialist competitive algorithm and population based simulated annealing (AICA + PBSA), are developed to solve the addressed problem. Because of the sensitivity of our proposed algorithm to parameter's values, we employed the Taguchi method as an optimisation technique to extensively tune different parameters of our algorithm to enhance solutions accuracy. These proposed algorithms were coded and tested on randomly generated instances, then to validate the effectiveness of them computational results are examined in terms of relative percentage deviation. Moreover, some sensitive analyses are carried out for appraising the behaviour of algorithms versus different conditions. The computational evaluations manifestly support the high performance of our proposed novel hybrid algorithm against other algorithms which were applied in literature for related production scheduling problems.
机译：在本文中，我们考虑了在无等待的柔性流水车间制造系统中安排一组n个作业的问题，该系统具有与序列有关的建立时间，以最大程度地减少最大完成时间。关于所考虑问题的NP硬度，似乎无法避免采用元启发式方法来实现该问题的最佳解决方案。因此，开发了三种新颖的元启发式算法，即基于种群的模拟退火（PBSA），适应帝国主义竞争算法（AICA）以及适应帝国主义竞争算法与基于种群的模拟退火算法（AICA + PBSA）的混合解决方案。由于我们提出的算法对参数值的敏感性，我们采用Taguchi方法作为一种优化技术来广泛调整算法的不同参数，以提高求解精度。对这些提出的算法进行编码并在随机生成的实例上进行测试，然后验证它们的有效性，并根据相对百分比偏差检查了计算结果。此外，进行了一些敏感的分析，以评估算法在不同条件下的行为。计算评估显然支持了我们提出的新型混合算法相对于其他算法的高性能，而其他算法已在文献中应用于相关的生产调度问题。

著录项

  • 来源
    《International Journal of Production Research》 |2012年第24期|7447-7466|共20页
  • 作者

    F. Jolai; M. Rabiee; H. Asefi;

  • 作者单位

    Department of Industrial Engineering, University of Tehran, Tehran, Iran;

    Department of Industrial Engineering, K. N. Toosi University of Technology, Tehran, Iran;

    Department of Industrial Engineering, University of Tehran, Kish Int'l Campus, Iran;

  • 收录信息 美国《科学引文索引》(SCI);美国《工程索引》(EI);
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    no-wait; flexible flow shop; ICA; PBSA; taguchi;

    机译：不用等待灵活的流动车间;ICA;PBSA;田口;

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号