The flower pollination algorithm with disparity count process for scheduling problem

The flexible job shop scheduling is the problem that found in the manufacturing industry and challenge for many researchers interested in this field. This paper proposed new algorithm for solving the flexible job shop scheduling problem (FJSP). The proposed algorithm is based on the flower pollination algorithm with a new concept called disparity count process. The performance of the proposed algorithm is compared with the other state-of-the-art metaheuristic algorithm. The results are evaluated in terms of the average percentage deviation from the lower bound. The experimental shown that the proposed algorithm found the number of best answer more than others algorithm.