科研之友
微信
新浪微博
Facebook
分享链接
摘要
Hybrid flow shop (HFS) scheduling problem is a kind of scheduling consisted of a series of stages, in which there exist more than one parallel machine. In this paper, we propose a meta-heuristics using a version of cooperative multi-swarm PSO algorithm for the HFS with minimum makespan objective. The main contribution of this algorithm is to import an electoral mechanism to accelerate the converging and a disturbance approach to help escape from local optima. Finally, experiments show that the algorithm outperforms all the compared in the HFS problem.
