A genetic algorithm for the Flexible Job-shop Scheduling Problem

被引：668
作者：
Pezzella, F. [1 ]
Morganti, G. [1 ]
Ciaschetti, G. [1 ]
机构：
[1] Univ Politecn Marche, Dipartimento Ingn Informat Gestionale & Automaz, I-60131 Ancona, Italy
来源：
COMPUTERS & OPERATIONS RESEARCH | 2008年 / 35卷 / 10期
关键词：
job-shop scheduling; genetic algorithms; flexible manufacturing systems;
D O I：
10.1016/j.cor.2007.02.014
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
In this paper, we present a genetic algorithm for the Flexible Job-shop Scheduling Problem (FJSP). The algorithm integrates different strategies for generating the initial population, selecting the individuals for reproduction and reproducing new individuals. Computational result shows that the integration of more strategies in a genetic framework leads to better results, with respect to other genetic algorithms. Moreover, results are quite comparable to those obtained by the best-known algorithm, based on tabu search. These two results, together with the flexibility of genetic paradigm, prove that genetic algorithms are effective for solving FJSP. (C) 2007 Elsevier Ltd. All rights reserved.
引用
收藏
页码：3202 / 3212
页数：11
相关论文
共 20 条
[1]  
[Anonymous], INT J INTELLIGENT MA
[2]  
Barnes J., 1996, Technical Report Series
[3]  
Brandimarte P., 1993, Annals of Operations Research, V41, P157, DOI 10.1007/BF02023073
[4]  
Chen HX, 1999, ICRA '99: IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, VOLS 1-4, PROCEEDINGS, P1120, DOI 10.1109/ROBOT.1999.772512
[5]   An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search [J].
DauzerePeres, S ;
Paulli, J .
ANNALS OF OPERATIONS RESEARCH, 1997, 70 (0) :281-306
[6]  
Feige U., 1998, Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, P624, DOI 10.1145/276698.276878
[7]  
FISHER H, 1968, IND SCHEDULING, P225
[8]  
Gambardella L, 1996, J SCHEDULING, V3, P3, DOI [10.1002/(SICI)1099-1425(200001/02)3:13::AID-JOS323.0.CO
[9]  
2-Y, DOI 10.1002/(SICI)1099-1425(200001/02)3]
[10]  
Garey M. R., 1976, Mathematics of Operations Research, V1, P117, DOI 10.1287/moor.1.2.117
12