...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>International Journal of Production Research >An efficient tabu search algorithm for the distributed permutation flowshop scheduling problem
【24h】

An efficient tabu search algorithm for the distributed permutation flowshop scheduling problem

机译：一种有效的禁忌搜索算法，解决分布式置换流水车间调度问题

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

摘要

Distributed permutation flow shop scheduling problem (DPFSP) is a newly proposed scheduling problem, which is a generalisation of classical permutation flowshop scheduling problem. Studies on algorithms for solving this problem are in the early stage. In this paper, we propose a new tabu algorithm for solving this problem, which exploits a novel tabu strategy. A method that swaps sub-sequences of jobs is presented to generate neighbourhood. Moreover, an enhanced local search method is proposed and also combined into the tabu algorithm. We also use the well-known benchmark of Taillard (extended to the distributed permutation flowshop problems) to test the algorithm. From the intensive experiments we carried out, we conclude that the proposed tabu algorithm outperforms all the existing algorithms including heuristics algorithms (i.e. NEH1, NEH2, VND(a) and VND(b)) and a hybrid genetic algorithm, so the best-known solutions for 472 instances are updated. Moreover, it is worth mentioning that the efficiency of the tabu algorithm is also better than that of the genetic algorithm.
机译：分布式置换流水车间调度问题（DPFSP）是一种新提出的调度问题，是经典置换流水车间调度问题的推广。解决该问题的算法的研究还处于早期阶段。在本文中，我们提出了一种新的禁忌算法来解决这个问题，它利用了一种新颖的禁忌策略。提出了一种交换工作子序列以生成邻居的方法。此外，提出了一种增强的局部搜索方法，并将其结合到禁忌算法中。我们还使用了著名的Taillard基准测试（扩展到分布式置换Flowshop问题）来测试算法。从我们进行的密集实验中，我们得出结论，所提出的禁忌算法优于所有现有算法，包括启发式算法（即NEH1，NEH2，VND（a）和VND（b））和混合遗传算法，因此广为人知472个实例的解决方案已更新。此外，值得一提的是，禁忌算法的效率也优于遗传算法。

著录项

  • 来源
    《International Journal of Production Research》 |2013年第4期|641-651|共11页
  • 作者

    Jian Gao; Rong Chen; Wu Deng;

  • 作者单位

    College of Information Science and Technology, Dalian Maritime University, Dalian, 116026, China;

    College of Information Science and Technology, Dalian Maritime University, Dalian, 116026, China;

    College of Information Science and Technology, Dalian Maritime University, Dalian, 116026, China;

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

    tabu search; distributed scheduling; flowshop; sequence swapping;

    机译：禁忌搜索;分布式调度;流水车间;序列交换;

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号