Abstract
This paper considers the application of IA for the classic permutation flow shop scheduling problem. We present a hybrid version of constructively built IA combining with the SA for the n-job, m-machine permutation flow shop scheduling problem to minimize makespan. Based on all the Taillard’s benchmark problems, the computational results suggest that the proposed method is very competitive with the existing methods in the literature.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
