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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Discrete Mathematical Sciences and Cryptography
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
