• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Science and technology to promote harmonized production >MULTI-PATH TABU SEARCH METHOD FOR JOB SHOP SCHEDULING PROBLEM
【24h】

MULTI-PATH TABU SEARCH METHOD FOR JOB SHOP SCHEDULING PROBLEM

机译：作业车间调度问题的多路径TABU搜索方法

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

摘要

Job shop scheduling problems (JSP) are known as NP-hard problems, which have been studied by a significant number of researchers for decades. Tabu Search, as one of the heuristic algorithms, has been widely researched and applied for scheduling problem. In this paper, a tabu search based job shop scheduling system with a new method called multi-path exploring is proposed. The multi-path exploring method employs more than one search path at one time to make the search can exploring larger decision space to reach the optimality. And when the selected path cannot provide improvement since a predetermined time, the search can exclude the current search path and select other path to explore to avoid the misguiding by local optimality. The tabu list is used to guide the search to explored regions. The length of it decides the efficiency of search, but actually it is impossible to set an appropriate length to the tabu list. To against this problem, we also proposed another method called tabu-recall to deal with it in this paper. The final experimental test shows the proposed scheduling system can provide a fast responsive and good object values.
机译：作业车间调度问题（JSP）被称为NP难题，许多研究人员已经研究了数十年。禁忌搜索作为一种启发式算法，已经得到了广泛的研究并将其应用于调度问题。本文提出了一种基于禁忌搜索的作业车间调度系统，该系统称为多路径探索。多路径探索方法一次采用多条搜索路径，使搜索可以探索更大的决策空间以达到最优。并且当选择的路径自预定时间以来不能提供改善时，搜索可以排除当前搜索路径，并选择其他要探索的路径，以避免因局部最优而引起的误导。禁忌列表用于引导搜索到探索的区域。它的长度决定了搜索的效率，但是实际上不可能为禁忌表设置适当的长度。为了解决这个问题，本文还提出了另一种称为禁忌召回的方法。最终的实验测试表明，所提出的调度系统可以提供快速响应和良好的对象值。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号