TY  - JOUR
T1  - Comparison of Memetic Algorithm and PSO in Optimizing Multi Job Shop Scheduling
AU - Nandhini, M. AU - Kanmani, S. 
JO  - Journal of Engineering and Applied Sciences
VL  - 7
IS  - 7
SP  - 421
EP  - 427
PY  - 2012
DA  - 2001/08/19
SN  - 1816-949x
DO  - jeasci.2012.421.427
UR  - https://makhillpublications.co/view-article.php?doi=jeasci.2012.421.427
KW  - Combinatorial optimization
KW  -genetic algorithm
KW  -local search
KW  -multi job shop scheduling
KW  -crossover
KW  -particle swarm optimization
KW  -optimal solution
AB  - This study 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 been 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.
ER  -