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.
Full Text
Published Version
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 call