A Hybrid PSO & TS Algorithm for FJSSP

A novel crossbred metaheuristic algorithm founded on Particle Swarm Optimization (PSO) and Tabu Search (TS) procedures is presented in this report. It is designed to solve Flexible Job Shop Scheduling Problems (FJSSP). Twelve benchmark examination examples from different lit origin are used for the experimental investigation of the algorithm. The obtained mean error for the deviation from optimality is 1.09%. The test results are good basis for further refinement of the proposed algorithm.