A Hybrid Algorithm for the Permutation Flow Shop Scheduling Problem
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.
KeywordsScheduling Immune algorithm Simulated annealing Permutation flow shop Makespan Shift neighborhood search
- Dasgupta, D.: Artificial immune systems and their applications. Springer (1999)Google Scholar
- Stuetzle, T.: An ant approach for the flow shop problem. Proceedings of the 6th European Congress on Intelligent Techniques and Soft Computing (EUFIT) 3, 1560–1564 (1998)Google Scholar
- Ahmadizar, F., Barzinpour, F.: A hybrid algorithm to minimize makespan for the permutation flow shop scheduling problem. International Journal of Computational Intelligence Systems 3, 853–861 (2010)Google Scholar