Abstract
Permutation flow shop scheduling problem is a complicated global optimum problem. In this paper, according to the characteristics of permutation flow shop scheduling problem, an improved bat algorithm was used to solve permutation flow shop scheduling problem. The algorithm was experimented and the experimental results show that the improved bat algorithm has better feasibility and validity for solving permutation flow shop scheduling problem.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
