PSO and simulated annealing for the two-machine flowshop scheduling problem with coupled-operations

摘要

In this paper, we proposed an hybrid algorithm combining particle swarm optimisation with the simulated annealing (PSO-SA) to solve the flowshop problem with coupled-operations in the presence of the time lags. The criterion to minimise is the makespan. To verify the performance of the hybridised algorithm, computational experiments are performed and the obtained results are compared with the simulated annealing and PSO algorithms. However, the experimental results show that the PSO-SA performs better than the others approaches.