论文标题
置换流量工厂的迭代光束搜索算法
Iterative beam search algorithms for the permutation flowshop
论文作者
论文摘要
我们研究了置换流量工厂的迭代光束搜索算法（MakePan和Flow Time最小化）。该算法结合了受到最近分支机构的启发的分支策略，以及受LR启发式启发的指导策略。它获得了竞争结果，在VFR基准（MakePAN最小化）和Taillard Benchmark（流动时间最小化）上报告了许多新的最佳解决方案，而无需使用任何基于NEH的分支或迭代性怪诞策略。源代码可在以下网址获得：https：//gitlab.com/librallu/cats-pfsp。
We study an iterative beam search algorithm for the permutation flowshop (makespan and flowtime minimization). This algorithm combines branching strategies inspired by recent branch-and-bounds and a guidance strategy inspired by the LR heuristic. It obtains competitive results, reports many new-best-so-far solutions on the VFR benchmark (makespan minimization) and the Taillard benchmark (flowtime minimization) without using any NEH-based branching or iterative-greedy strategy. The source code is available at: https://gitlab.com/librallu/cats-pfsp.
