Security based bi-objective flow shop scheduling model and its hybrid genetic algorithm

In this paper, we considered the flow shop scheduling problem with respect to the both objectives of the makespan and the mean continuous running time, proposed a security based bi-objective flow shop scheduling model. To solve the proposed model more effectively, we presented a hybrid genetic algorithm (HGA), which used some tailor made genetic operators and a local search operator in order to improve the local search ability of GA. The proposed algorithm is tested with some well-known problems in literature. The computational results demonstrated the effectiveness of the proposed algorithm.