Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Mohammad Akhshabi (2011) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: