期刊名称：Inteligencia Artificial : Ibero-American Journal of Artificial Intelligence
印刷版ISSN：1137-3601
电子版ISSN：1988-3064
出版年度：2018
卷号：21
期号：61
页码：111-123
语种：English
出版社：Spanish Association for Intelligence Artificial
其他摘要：This paper proposes a multi-start local search algorithm that solves the flexible job-shop scheduling (FJSP) problem to minimize makespan. The proposed algorithm uses a path-relinking method to generate near optimal solutions. A heuristic parameter, $\alpha$, is used to assign machines to operations.Also, a tabu list is applied to avoid getting stuck at local optimums.The proposed algorithm is tested on two sets of benchmark problems (BRdata and Kacem) to make a comparison with the variable neighborhood search.The experimental results show that the proposed algorithm can produce promising solution in a shorter amount of time.
