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
User
Information