Parallel bat algorithm for optimizing makespan in job shop scheduling problems

Parallel processing plays an important role in efficient and effective computations of function optimization. in this paper, an optimization algorithm based on parallel versions of the bat algorithm (ba), random-key encoding scheme, communication strategy scheme and makespan scheme is proposed to solve the np-hard job shop scheduling problem. the aim of the parallel ba with communication strategies is to correlate individuals in swarms and to share the computation load over few processors. based on the original structure of the ba, the bat populations are split into several independent groups. in addition, the communication strategy provides the diversity-enhanced bats to speed up solutions. in the experiment, forty three instances of the benchmark in job shop scheduling data set with various sizes are used to test the behavior of the convergence, and accuracy of the proposed method. the results compared with the other methods in the literature show that the proposed scheme increases more the convergence and the accuracy than ba and particle swarm optimization.