%0 Journal Article
%A LI Fan1
%A GAO Dong1
%A XU Xin2
%A ZHANG Yuliang2
%T Research of improved bat algorithm for flexible job-shop scheduling problem
%D 2018
%R 10.3778/j.issn.1002-8331.1707-0466
%J Computer Engineering and Applications
%P 265-270
%V 54
%N 21
%X In order to solve the flexible job-shop scheduling problem, an improved discrete bat algorithm is proposed. The two-tier coding sequence, balanced machine load distribution scheme and plug-in decoding strategy are used to initialize the population. The operators and operations of the discrete bat algorithm’s speed, location update are designed. The balance factor is introduced to improve the search ability. It is proved that compared with other algorithms, the improved discrete bat algorithm can effectively solve the flexible job-shop scheduling problem and has higher accuracy.
%U http://cea.ceaj.org/EN/10.3778/j.issn.1002-8331.1707-0466