| |
Issue No:10 Vol.4 |
October-2011 |
ISSN: 0974-5645 |
| RESEARCH ARTICLES |
Viewers & PDF |
| 9. Solving flexible job-shop scheduling problem using clonal selection algorithm. Mohammad Akhshabi, Mostafa Akhshabi and Javad Khalatbari. Indian J.Sci.Technol. Vol. 4, Issue 10, pp: 1248-1251. Domain site: http://www.indjst.org. |

|
-
Abstract
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.
|
| |
|
|
|