A comparison of two multirecombinated evolutionary algorithms for the job shop scheduling problem

Over the past few years, a continually increasing number of research efforts have investigated the application of evolutionary computation techniques for the solution of scheduling problems. Scheduling problems can pose extremely complex combinatorial optimization problems, which belong to the NP-h...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Minetti, Gabriela F., Salto, Carolina, Alfonso, Hugo, Gallard, Raúl Hector
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2000
Materias:
Ciencias Informáticas
evolutionary algorithms
multiplicity
Scheduling
Optimization
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/23428
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-23428
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Inglés
topic Ciencias Informáticas
evolutionary algorithms
multiplicity
Scheduling
Optimization
spellingShingle Ciencias Informáticas
evolutionary algorithms
multiplicity
Scheduling
Optimization
Minetti, Gabriela F.
Salto, Carolina
Alfonso, Hugo
Gallard, Raúl Hector
A comparison of two multirecombinated evolutionary algorithms for the job shop scheduling problem
topic_facet Ciencias Informáticas
evolutionary algorithms
multiplicity
Scheduling
Optimization
description Over the past few years, a continually increasing number of research efforts have investigated the application of evolutionary computation techniques for the solution of scheduling problems. Scheduling problems can pose extremely complex combinatorial optimization problems, which belong to the NP-hard family. This work shows how an evolutionary approach using different chromosome representations with multiplicity feature MCMP can efficiently solve the JSSP.
format Objeto de conferencia
Objeto de conferencia
author Minetti, Gabriela F.
Salto, Carolina
Alfonso, Hugo
Gallard, Raúl Hector
author_facet Minetti, Gabriela F.
Salto, Carolina
Alfonso, Hugo
Gallard, Raúl Hector
author_sort Minetti, Gabriela F.
title A comparison of two multirecombinated evolutionary algorithms for the job shop scheduling problem
title_short A comparison of two multirecombinated evolutionary algorithms for the job shop scheduling problem
title_full A comparison of two multirecombinated evolutionary algorithms for the job shop scheduling problem
title_fullStr A comparison of two multirecombinated evolutionary algorithms for the job shop scheduling problem
title_full_unstemmed A comparison of two multirecombinated evolutionary algorithms for the job shop scheduling problem
title_sort comparison of two multirecombinated evolutionary algorithms for the job shop scheduling problem
publishDate 2000
url http://sedici.unlp.edu.ar/handle/10915/23428
work_keys_str_mv AT minettigabrielaf acomparisonoftwomultirecombinatedevolutionaryalgorithmsforthejobshopschedulingproblem
AT saltocarolina acomparisonoftwomultirecombinatedevolutionaryalgorithmsforthejobshopschedulingproblem
AT alfonsohugo acomparisonoftwomultirecombinatedevolutionaryalgorithmsforthejobshopschedulingproblem
AT gallardraulhector acomparisonoftwomultirecombinatedevolutionaryalgorithmsforthejobshopschedulingproblem
AT minettigabrielaf comparisonoftwomultirecombinatedevolutionaryalgorithmsforthejobshopschedulingproblem
AT saltocarolina comparisonoftwomultirecombinatedevolutionaryalgorithmsforthejobshopschedulingproblem
AT alfonsohugo comparisonoftwomultirecombinatedevolutionaryalgorithmsforthejobshopschedulingproblem
AT gallardraulhector comparisonoftwomultirecombinatedevolutionaryalgorithmsforthejobshopschedulingproblem
bdutipo_str Repositorios
_version_ 1764820465908449280

Ejemplares similares