A fast hybrid particle swarm optimization algorithm for flow shop sequence dependent group scheduling problem

A particle swarm optimization (pso) algorithm for a flow shop sequence dependent group scheduling (fsdgs) problem, with minimization of total flow time as the criterion (fm|fmls, splk, prmu|σ cj), is proposed in this research. an encoding scheme based on ranked order value (rov) is developed, which converts the continuous position value of particles in pso to job and group permutations. a neighborhood search strategy, called individual enhancement (ie), is fused to enhance the search and to balance the exploration and exploitation. the performance of the algorithm is compared with the best available meta-heuristic algorithm in literature, i.e. the ant colony optimization (aco) algorithm, based on available test problems. the results show that the proposed algorithm has a superior performance to the aco algorithm.