Application of a Novel Simulated Annealing in Flow Shop Scheduling Problem

Flow shop scheduling problem (FSP) is a classical NP-hard problem., which has the wide application in many fields of manufacturing. This paper put forward a novel simulated annealing for solving FSP. The main characteristic of the algorithm is that the new solution in each iteration is generated by two random numbers, which improves the global convergence. By the algorithm solving the FSP, Numerical results show that this algorithm is more efficient and is able to converge to the global optimal solutions.