Dragonfly algorithm for Solving Flexible Jobshop Scheduling Problem

Industrial scheduling problem has always been one of key problems in manufacturing and management planning enterprises. Flexible job shop scheduling problem is one of most difficult scheduling problems, which is also a classical NP hard problem. Compared to the JSP, each process in the FJSP should be processed on each available machine to minimize the total processing time. For this reason, it is far more complex than the classic JSP. In this paper, a recent proposed swarm intelligence algorithm named dragonfly algorithm (DA) is adopted to solve the FJSP. Some traditional algorithms are also used to evaluate the performance on several famous FJSP benchmark compared with DA. Numerical results show that DA has stronger global searching ability and can achieve better results in solving FJSP than other algorithms.