Services on Demand
Journal
Article
Indicators
Cited by SciELO
Access statistics
Related links
Similars in
SciELO
uBio
Share
Universidad, Ciencia y Tecnología
Print version ISSN 1316-4821On-line version ISSN 2542-3401
Abstract
MATEO DOLL, Manuel and D' ARMAS REGNAULT, Mayra. SEQUENCE SCHEDULING OF JOB ORDERS USING GENETIC ALGORITHMS . uct [online]. 2008, vol.12, n.49, pp.217-226. ISSN 2542-3401.
The present work can be located in the frame of production scheduling and pretends to evaluate, by means of computational tests, the behavior of Genetic Algorithms to solve a scheduling problem. The dealt problem considers a single machine with sequence-dependent setup times and due dates for a set of orders, with the objective to minimize their mean tardiness. Since the optimal solution requires an excessively long time, it is applied a metaheuristic algorithm, within the group of Genetic Algorithms. Therefore, each one of the operators used in Genetic Algorithms is adapted to the problem and tested on 300 instances with a total number of jobs between 10 and 15. The results demonstrate the effectiveness of the algorithm for the specific problem studied. Supposing a running time of one minute per instance to obtain a solution, the proposed size of the population is the sum of the batches of the orders and the number of generations, three times this value. The best solutions are reached with a probability of 100% in the crossover, probability of 30% in the mutation and when crossovers of 1 point and PMX and the pair mutation are combined.
Keywords : Scheduling; Single machine; Sequence-dependent setup times; Metaheuristics; Genetic Algorithms.













