A Fast Hybrid Algorithm for Job Shop Scheduling Problems

The paper designed a fast hybrid algorithm for the job shop scheduling problems.The feature of the job shop scheduling problem was considered, and block neighbor solutions based on critical path was used in it, tabu search algorithm and particle swarm optimization were all included in it.A new function was created to quickly estimate the performance of the candidate solutions, and drop the bad ones, so it can decrease the search space deeply.A simulation indicates that the new algorithm has good efficiency and performance.