期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 301, 期 1, 页码 217-234出版社
ELSEVIER
DOI: 10.1016/j.ejor.2021.10.015
关键词
Heuristics; Iterative beam search; Permutation flowshop; Makespan; Flowtime
We examine an iterative beam search algorithm for the permutation flowshop problem, which combines branching strategies from recent branch-and-bounds algorithms and a guidance strategy inspired by the LR heuristic. The algorithm achieves competitive results on large instances and reports numerous new-best-so-far solutions on the VFR and Taillard benchmarks without using NEH-based branching or iterative-greedy strategies.
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 on large instances compared to the state-of-the-art algorithms, reports many new-best-so-far solutions on the VFR benchmark (makespan minimization) and the Taillard benchmark (flowtime minimization) without using any NEHbased branching or iterative-greedy strategy. The source code is available at: https://github.com/librallu/ dogs-pfsp . (c) 2021 Published by Elsevier B.V.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据