...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>International Journal of Production Research >Fast local neighborhood search algorithm for the no-wait flow shop scheduling with total flow time minimization
【24h】

Fast local neighborhood search algorithm for the no-wait flow shop scheduling with total flow time minimization

机译：快速的局部邻域搜索算法，用于无等待流水车间调度，总流水时间达到最小

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

摘要

A fast local neighbourhood search (FLNS) algorithm is proposed in this paper to minimise the total flow time in the no-wait flow shop scheduling problem, which is known to be NP-hard for more than two machines. In this work, an unscheduled job sequence is constructed firstly according to the total processing time and standard deviation of jobs on the machines. This job sequence is undergone an initial optimisation using basic neighbourhood search algorithm. Then, an innovative local neighbourhood search scheme is designed to search for the partial neighbourhood in each iterative processing and calculate the neighbourhood solution with an objective increment method. This not only improves the solution quality significantly, but also speeds up the convergence of the solution of the algorithm. Moreover, a probabilistic acceptance criterion is adopted to help our method escape from the local optima. Based on Taillard's benchmarks, the experimental results show that the proposed FLNS algorithm is superior to major existing algorithms (IHA, IBHLS, GA-VNS and DHS) in terms of both quality and robustness, and can provide best upper bounds. The in-depth statistical analysis demonstrates that the promising performance of our proposed algorithm is also statistically significant.
机译：本文提出了一种快速局部邻域搜索（FLNS）算法，以最大程度地减少无等待流水车间调度问题中的总流时间，该问题对于两台以上的机器来说是NP难的。在这项工作中，首先根据总处理时间和机器上作业的标准偏差来构造计划外的作业序列。使用基本邻域搜索算法对该作业序列进行了初始优化。然后，设计了一种创新的局部邻域搜索方案，以在每次迭代处理中搜索部分邻域，并使用客观增量法计算邻域解。这不仅大大提高了解的质量，而且加快了算法解的收敛速度。此外，采用概率接受准则来帮助我们的方法摆脱局部最优。基于Taillard的基准，实验结果表明，所提出的FLNS算法在质量和鲁棒性方面均优于主要的现有算法（IHA，IBHLS，GA-VNS和DHS），并且可以提供最佳的上限。深入的统计分析表明，我们提出的算法的有希望的性能在统计上也很重要。

著录项

  • 来源
    《International Journal of Production Research》 |2016年第16期|4957-4972|共16页
  • 作者

    Qi Xuemei; Wang Hongtao; Zhu Haihong; Zhang Ji; Chen Fulong; Yang Jie;

  • 作者单位

    Anhui Normal Univ, Sch Math & Comp Sci, Wuhu, Peoples R China|Anhui Normal Univ, Network & Informat Secur Engn Res Ctr, Wuhu, Peoples R China;

    Anhui Normal Univ, Sch Math & Comp Sci, Wuhu, Peoples R China|Anhui Normal Univ, Network & Informat Secur Engn Res Ctr, Wuhu, Peoples R China;

    Anhui Normal Univ, Sch Math & Comp Sci, Wuhu, Peoples R China|Anhui Normal Univ, Network & Informat Secur Engn Res Ctr, Wuhu, Peoples R China;

    Univ Southern Queensland, Fac Hlth Engn & Sci, Toowoomba, Qld, Australia;

    Anhui Normal Univ, Sch Math & Comp Sci, Wuhu, Peoples R China|Anhui Normal Univ, Network & Informat Secur Engn Res Ctr, Wuhu, Peoples R China;

    Anhui Normal Univ, Sch Math & Comp Sci, Wuhu, Peoples R China|Anhui Normal Univ, Network & Informat Secur Engn Res Ctr, Wuhu, Peoples R China;

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

    no-wait flow shop scheduling; local neighbourhood search; total flow time; statistical analysis;

    机译：无等待流水车间调度;局部邻域搜索;总流水时间;统计分析;

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号