Using hybrid GA-PSO algorithm to solve problem in machine scheduling

Abstract

In this paper, we describe new hybrid genetic algorithm and particle swarm optimization to solve the sum of earliness and the number of tardy job on two-machines flow shop schedule problem is NP- hard. The study discusses a hybrid genetic algorithm and particle swarm optimization (HGA-PSO) to tackle the presented mission. Extensive experiments, based on computers, suggest that the proposed mathematical models are efficient in solving flow shop problems with GA solved to n = 3000 while PSO solved to n = 500 job.