A guide for genetic algorithm based on parallel machine scheduling and flexible job-shop scheduling
Özet
Parallel Machine Scheduling (PMS) and Flexible Job-shop Scheduling (FJS) are the hardest combinatorial optimization problems, they require very large scale search space. Solving this kind of combinatorial optimization problems with classical methods are almost impossible or takes considerable long time. Genetic Algorithms (GAs) have shown great advantages in solving combinatorial problems. GAs have the flexibility of set up different chromosome structures in case of distinctive scheduling problems. This paper presents a PMS and FJS chromosome structure, crossover and mutation operator from literature in order to guide for new researchers about scheduling with GAs. (C) 2012 Published by Elsevier Ltd. Selection and/or peer review under responsibility of Prof. Dr. Huseyin Arasli
