%0 Journal Article
%T Makespan Minimization for The Identical Machine Parallel Shop with Sequence Dependent Setup Times Using a Genetic Algorithm
%A Salazar-Hornig E.
%A Medina-S.J.C.
%J Ingenier¨ªa, investigaci¨®n y tecnolog¨ªa
%D 2013
%I Universidad Nacional Aut¨®noma de Mexico (UNAM)
%X A genetic algorithm for the parallel shop with identical machines scheduling problem with sequence dependent setup times and makespan (Cm¨¢x) minimization is presented. The genetic algorithm is compared with other heuristic methods using a randomly generated test problem set. A local improvement procedure in the evolutionary process of the genetic algorithm is introduced, which significantly improves its performance.
%K identical parallel machines
%K genetic algorithms
%K heuristics.
%U http://www.ingenieria.unam.mx/~revistafi/ejemplares/V14N1/V14N1_art05.pdf