Makespan Minimization for The Identical Machine Parallel Shop with Sequence Dependent Setup Times Using a Genetic Algorithm

Salazar-Hornig, E.; Medina-S., J. C.

Servicios Personalizados

Revista

Articulo

Indicadores

Links relacionados

Similares en SciELO

Permalink

Ingeniería, investigación y tecnología

versión On-line ISSN 2594-0732versión impresa ISSN 1405-7743

Resumen

SALAZAR-HORNIG, E. y MEDINA-S., J. C.. Makespan Minimization for The Identical Machine Parallel Shop with Sequence Dependent Setup Times Using a Genetic Algorithm. Ing. invest. y tecnol. [online]. 2013, vol.14, n.1, pp.43-51. ISSN 2594-0732.

A genetic algorithm for the parallel shop with identical machines scheduling problem with sequence dependent setup times and makespan (C_max) 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.

Palabras llave : identical parallel machines; genetic algorithms; heuristics.

· resumen en Español · texto en Español