• P-ISSN 0974-6846 E-ISSN 0974-5645

Indian Journal of Science and Technology


Indian Journal of Science and Technology

Year: 2011, Volume: 4, Issue: 10, Pages: 1248-1251

Original Article

Solving flexible job-shop scheduling problem using clonal selection algorithm


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.