INVESTIGADORES
FRUTOS Mariano
congresos y reuniones científicas
Título:
FLEXIBLE JOB-SHOP SCHEDULING PROBLEM (FLEXIBLE JSSP): HYBRID GENETIC ALGORITHM WITH TWO-CHROMOSOMES AND MULTIPLE-OPERATORS
Autor/es:
MARIANO FRUTOS; ANA C. OLIVERA; FERNANDO TOHMÉ
Lugar:
Chicago
Reunión:
Simposio; XX International Symposium of Mathematical Programmin; 2009
Institución organizadora:
University of Chicago
Resumen:
While the theoretical solutions of MOPs are PO, the actual solutions of these problems, due to the many sources of complexity that hamper them, tend to exhibit a clear lack of efficiency. This particular problem has been addressed in the last decades by means of the successful application of techniques based on GAs (MOGA, NPGA-II, NSGA-II, JGGA, SPEA-II, PAES, MICROGA). In this paper we assess these techniques in the framework of JSSPs.
