SciELO - Scientific Electronic Library Online

 
vol.24 issue3Selection of Improvement Strategies for Working Condition for to Maintenance Function Using Constructivist Multicriteria Decision Aid Approach MCDAOptimization of the Thermal Efficiency of a Robinson Engine Applying the Senft-Schmidt-Petrescu Model author indexsubject indexarticles search
Home Pagealphabetic serial listing  

Services on Demand

Journal

Article

Indicators

Related links

Share


Información tecnológica

On-line version ISSN 0718-0764

Abstract

ARANGO, Jaime A; GIRALDO, Jaime A  and  CASTRILLON, Omar D. Scheduling of Non-Related Parallel Machines with Sequence Dependent Setup Times and Dynamic Entry using Genetic Algorithms. Inf. tecnol. [online]. 2013, vol.24, n.3, pp.73-84. ISSN 0718-0764.  http://dx.doi.org/10.4067/S0718-07642013000300009.

This paper describes a solution method to the problem of processing n jobs on m non-related parallel machines. It is a linear and combinatorial generalized allocation problem that considered a sequence-dependent setup time and dynamic job entry. A genetic algorithm with integer coding and random generation of population, parent selection, crossover and mutation is proposed. There are two descendants per generation that are compared against the worst existing element to enter to population. After a number of generations that is proportional to the product of nxm the solution is generated. The jobs are sequenced on each machine by due date and computational times are acceptable. It is concluded that the proposed genetic algorithm is an effective and efficient solution that focuses on reducing processing time and on meeting deadlines.

Keywords : meta-heuristics; parallel machines; optimization; activity scheduling.

        · abstract in Spanish     · text in Spanish     · Spanish ( pdf )

 

Creative Commons License All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License