A Parallel Genetic Algorithm for the Job Shop Scheduling Problem

被引:0
作者
Nguyen Huu Mui [1 ]
Vu Dinh Hoa [1 ]
Luc Tri Tuyen [2 ]
机构
[1] Hanoi Univ Educ, Dept Informat Technol, Hanoi 010000, Vietnam
[2] Vietnam Acad Sci & Technol, Inst Informat Technol, Hanoi 010000, Vietnam
来源
2012 IEEE INTERNATIONAL SYMPOSIUM ON SIGNAL PROCESSING AND INFORMATION TECHNOLOGY (ISSPIT) | 2012年
关键词
job shop scheduling; parallel genetic algorithm;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
This paper presents a parallel genetic algorithm for the job shop scheduling problem (JSP). There are following innovations in this new algorithm: active schedules are created by the priority rules of Giffler and Thompson [1]; the mutation uses neighborhood searching techniques; the crossover uses GT algorithm and is performed on 3 parents. We illustrate this new method on the parameters of Muth and Thompson's benchmark problems. it can produce optimal solutions at a high percentage of accuracy. Our proposed method is preeminent in comparison with other methods on both the calculation time and the speed of finding optimal solutions.
引用
收藏
页码:19 / 24
页数:6
相关论文
共 10 条