A new Charged System Search algorithm (CSS) for flexible job shop scheduling problem

We adopted a new meta-heuristic algorithm for solving Flexible job shop scheduling (FJSP) to minimize the maximum completion time known as makespan .FJSP is one of the major combinatorial problems in term of complexity and has taken many attraction in recent years. FJSP permits an operation to be processed by any of machines from its machine alternative set. It is the generalization of the job shop scheduling and is highly NP-hard. This paper presented the Charged System Search (CSS) algorithm approach that is inspired from governing laws of motion from the Newtonian mechanics and Coulomb and Gauss laws from electrical physics.To make the CSS algorithm adaptive to the FJSP a new converting technique known as two vector code representation is adopted. At the end we compared our results with previous approaches. The computational results show that the utilized algorithm is a promising method in the field of FJSP.

کلیدواژه ها:

: Scheduling ، Flexible job shop problem ، Charged System Search ، Local search ، Makespan