Permutation flow-shop scheduling problem based on new hybrid crow search algorithm
To solve the permutation flow-shop scheduling problem with the objective to minimize makespan more ef-fectively,a New Hybrid Crow Search Algorithm(NHCSA)was proposed.A NEH-based heuristic was modified,based on which a new method was put forward to ameliorate the quality and diversity of the initial population.Then,the Smallest-Position-Value(SPV)rule was adopted to enable the algorithm to deal with discrete scheduling prob-lems.For the iterated greedy algorithm,a method was come up with to adjust the range of re-inserted jobs automat-ically,a Tie-Breaking(TB)mechanism was embedded,and the improved iterated greedy algorithm was incorporated as a local search scheme for the best job permutation to improve the searching accuracy of the proposed algorithm.Simulations based on the well-known benchmarks were carried out,and the results validated the optimization ability and stability.Especially in the comparisons for Rec19 and Rec25 test cases,only NHCSA achieved the current opti-mal solutions,which further proves its superiority.
NETL
NSTL
万方数据
