摘要
The permutation flow shop scheduling problem (PFSP) which is known to be NP-hard has been widely investigated in recent years. In this paper, an effective hybrid discrete biogeography-based optimization (HDBBO) algorithm is proposed for solving the PFSP with the objective to minimise the makespan. Opposition-based learning method and the NEH heuristic are utilised in the HDBBO to generate an initial population with certain quality and diversity. Moreover, a novel variable local search strategy is presented and incorporated within the biogeography-based optimization framework to improve the exploitation ability. Computational results on two typical benchmark suits and comparisons with some state-of-the-art algorithms are presented to show the effectiveness of the HDBBO scheme.
学科与关键词
- An effective hybrid biogeography-based optimization algorithm for the distributed assembly permutation flow-shop scheduling problemLin, Jian*; Zhang, ShuaiCOMPUTERS & INDUSTRIAL ENGINEERING, 2016, 97: 128-136.被引 105
- A Modified Biogeography-Based Optimization for the Flexible Job Shop Scheduling ProblemYang, Yuzhen*MATHEMATICAL PROBLEMS IN ENGINEERING, 2015, 2015: 184643.被引 8
- A hybrid harmony search algorithm with efficient job sequence scheme and variable neighborhood search for the permutation flow shop scheduling problemsZhao, Fuqing*; Liu, Yang; Zhang, Yi; Ma, Weimin; Zhang, ChuckENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2017, 65: 178-199.被引 65
