期刊
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE
卷 85, 期 -, 页码 129-145出版社
ELSEVIER
DOI: 10.1016/j.future.2018.03.020
关键词
Flow shop scheduling; Makespan; Whale optimization algorithm; Hybrid algorithm; Local search
The flow shop scheduling problem is one of the most important types of scheduling with a large number of real-world applications. In this paper, we propose a new algorithm that integrates the Whale Optimization Algorithm (WOA) with a local search strategy for tackling the permutation flow shop scheduling problem. The Largest Rank Value (LRV) requires the algorithm to deal with the discrete search space of the problem. The diversity of candidate schedules is improved using a swap mutation operation as well. In addition to the insert-reversed block operation is adopted to escape from the local optima. The proposed hybrid whale algorithm (HWA) is incorporated with Nawaz-Enscore-Ham (NEH) to improve the performance of the algorithm. It is observed that HWA gives competitive results compared to the existing algorithms. (C) 2018 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据