Indian Journal of Science and Technology
Year: 2011, Volume: 4, Issue: 10, Pages: 1248-1251
Mohammad Akhshabi1 * , Mostafa Akhshabi2 and Javad Khalatbari3
1* Department of Industrial Engineering, Islamic Azad University Ramsar Branch , P.O. Box 46819-66856, Ramsar, Iran
2 Young Researchers Club, Neyshabur Branch, Islamic Azad University, Neyshabur, Iran
3 Department of Managment, Islamic Azad University Ramsar Branch , P.O. Box 46819-66856, Ramsar, Iran
[email protected] *; [email protected] ; [email protected]
In this paper we present a clonal selection algorithm (CSA) to solve the Flexible Job-shop Scheduling Problem (FJSP). The scheduling objective minimizes the maximal completion time of all the operations, which is denoted by Makespan. The performance of CSA is evaluated in comparison with Lingo 8 software. Experimental results prove that the CSA can be used to solve FJSP effectively.
Keywords: Flexible Job-shop Scheduling Problem, Clonal selection algorithm, Makespan
Subscribe now for latest articles and news.