• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Journal of Manufacturing Systems >Beam Search Algorithms for the Early/Tardy Scheduling Problem with Release Dates
【24h】

Beam Search Algorithms for the Early/Tardy Scheduling Problem with Release Dates

机译：带有发布日期的提前/迟到调度问题的波束搜索算法

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

摘要

This paper presents several beam search algorithms for the single-machine earliness/tardiness scheduling problem with release dates and no unforced idle time. These algorithms include classical beam search procedures, with both priority and total cost evaluation functions, as well as the filtered and recovering variants. Both priority evaluation functions and problem-specific properties were considered for the filtering step used in the filtered and recovering procedures. The computational results show that the recovering beam search algorithms outperform their filtered counterparts, while the priority-based filtering procedure proves superior to the rules-based alternative. The beam search procedure with a total cost function provides very good results but is computationally expensive. The recovering algorithm is quite close in solution quality and is significantly faster, so it can be used to solve even large instances.
机译：本文针对具有发布日期且没有非强制性空闲时间的单机提前/延迟调度问题提出了几种波束搜索算法。这些算法包括具有优先级和总成本评估功能的经典波束搜索过程，以及经过过滤和恢复的变量。在过滤和恢复过程中使用的过滤步骤考虑了优先级评估功能和特定问题的属性。计算结果表明，恢复波束搜索算法的性能优于已过滤的波束搜索算法，而基于优先级的滤波过程被证明优于基于规则的算法。具有总成本函数的波束搜索过程提供了很好的结果，但是计算量很大。恢复算法在解决方案质量方面非常接近，并且速度明显更快，因此可以用于解决大型实例。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号