PSO Algorithm for Minimizing Total Flow Time in Group Scheduling Problem

A particle swarm optimization (PSO) algorithm for flow shop sequence dependent group scheduling (FSDGS) problem with minimization of total flow time (F, finils, Silk, primuy Ci) 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 permutation and group permutation. A neighborhood search strategy called individual enhancement (IE) is fused to enhance the search and to balance the exploration and exploitation. The hybrid method are called PSOIE method. The performance of the PSOIE algorithm is compared with the available algorithms in literature based on available test problems. The results show that the proposed algorithm has a superior performance compared to the available ones in literature.

Keywords:

Group scheduling , Particle swarm optimization , Sequence dependent scheduling , Meta-heuristics