%0 Journal Article
%T Un algoritmo gen¨¦tico para el problema de Job Shop Flexible
%A Medina Dur¨¢n
%A Rosa
%A Pradenas Rojas
%A Lorena
%A Parada Daza
%A V¨ªctor
%J Ingeniare. Revista chilena de ingenier¨ªa
%D 2011
%I Scientific Electronic Library Online
%R 10.4067/S0718-33052011000100006
%X this study proposes and computationally implements a sequential genetic algorithm to solve the flexible job shop problem (found in operations management), which is part of the family of job or task scheduling problems in a shop that works on demand. it is a generalization of the job shop problem, and allows optimizing the use of resources (machines) in the shop, with greater flexibility, since each machine can perform more than one operation. this problem has been studied by many authors, who have proposed various mathematical models and heuristic approaches. due to the combinatorial nature of the problem, the exact methods that solve the mathematical models are often solutions for small and simple instances of the problem. the results show the effectiveness of the proposed algorithm to provide good solutions in reasonable computational times in over 130 instances found in the literatura.
%K flexible job shop problem
%K genetic algorithms
%K scheduling
%K combinatorial optimization
%K operations management.
%U http://www.scielo.cl/scielo.php?script=sci_abstract&pid=S0718-33052011000100006&lng=en&nrm=iso&tlng=en