A New Artificial Immune Algorithm for Flexible Job-Shop Scheduling

Abstract:

Article Preview

Flexible job-sop scheduling problem (FJSP) is based on the classical job-shop scheduling problem (JSP). however, it is even harder than JSP because of the addition of machine selection process in FJSP. An improved artificial immune algorithm, which combines the stretching technique and clonal selection algorithm is proposed to solve the FJSP. The algorithm can keep workload balance among the machines, improve the quality of the initial population and accelerate the speed of the algorithm’s convergence. The details of implementation for the multi-objective FJSP and the corresponding computational experiments are reported. The results indicate that the proposed algorithm is an efficient approach for the multi-objective FJSP.

Info:

Periodical:

Advanced Materials Research (Volumes 121-122)

Edited by:

Donald C. Wunsch II, Honghua Tan, Dehuai Zeng, Qi Luo

Pages:

266-270

DOI:

10.4028/www.scientific.net/AMR.121-122.266

Citation:

L. Hong "A New Artificial Immune Algorithm for Flexible Job-Shop Scheduling", Advanced Materials Research, Vols. 121-122, pp. 266-270, 2010

Online since:

June 2010

Authors:

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.