Solving flexible job-shop scheduling problem using clonal selection algorithm

Mohammad Akhshabi; Mostafa Akhshabi  and Javad Khalatbari

doi:10.17485/ijst/2011/v4i10.25

Article

Solving flexible job-shop scheduling problem using clonal selection algorithm

VIEWS 686
PDF 300

Abstract
Full-Text HTML
Full-Text PDF
How to Cite

Indian Journal of Science and Technology

DOI: 10.17485/ijst/2011/v4i10.25

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

Original Article

Solving flexible job-shop scheduling problem using clonal selection algorithm

Mohammad Akhshabi^{1 *} , Mostafa Akhshabi² and Javad Khalatbari³

^1* Department of Industrial Engineering, Islamic Azad University Ramsar Branch , P.O. Box 46819-66856, Ramsar, Iran
² Young Researchers Club, Neyshabur Branch, Islamic Azad University, Neyshabur, Iran
³ Department of Managment, Islamic Azad University Ramsar Branch , P.O. Box 46819-66856, Ramsar, Iran
[email protected] *; [email protected] ; [email protected]

This work is licensed under a Creative Commons Attribution 4.0 International License.

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