期刊名称：International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
印刷版ISSN：2278-1323
出版年度：2012
卷号：1
期号：5
页码：256-261
出版社：Shri Pannalal Research Institute of Technolgy
摘要：In this paper, proposes a memetic algorithm to optimize multi objective multi job shop scheduling problems. It consists of customized genetic algorithm and local search of steepest ascent hill climbing algorithm. In genetic algorithm, the customization is done on genetic operators so that new selection, crossover and mutation operators have been proposed. The experimental study has done on benchmark multi job shop scheduling problem and its versatility is proved by comparing its performance with the results of simple genetic algorithm and particle swarm optimization .
关键词：Combinatorial optimization; genetic algorithm; particle swarm optimization; local search; multi job shop scheduling; optimal solution
