Services on Demand
Journal
Article
Indicators
Related links
Similars in SciELO
Share
Ingeniería, investigación y tecnología
On-line version ISSN 2594-0732Print version ISSN 1405-7743
Abstract
SALAZAR-HORNIG, E. and 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 (Cmax) 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.
Keywords : identical parallel machines; genetic algorithms; heuristics.