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

Autores
Minetti, Gabriela F.; Salto, Carolina; Alfonso, Hugo; Gallard, Raúl Hector
Año de publicación
2000
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
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.
I Workshop de Agentes y Sistemas Inteligentes (WASI)
Red de Universidades con Carreras en Informática (RedUNCI)
Materia
Ciencias Informáticas
evolutionary algorithms
multiplicity
Scheduling
Optimization
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/23428
Acceder
id SEDICI_abf533400572070ce5c281af470c5f76
oai_identifier_str oai:sedici.unlp.edu.ar:10915/23428
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling A comparison of two multirecombinated evolutionary algorithms for the job shop scheduling problemMinetti, Gabriela F.Salto, CarolinaAlfonso, HugoGallard, Raúl HectorCiencias Informáticasevolutionary algorithmsmultiplicitySchedulingOptimizationOver 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.I Workshop de Agentes y Sistemas Inteligentes (WASI)Red de Universidades con Carreras en Informática (RedUNCI)2000-10info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdfhttp://sedici.unlp.edu.ar/handle/10915/23428enginfo:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/2.5/ar/Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-29T10:55:26Zoai:sedici.unlp.edu.ar:10915/23428Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-29 10:55:26.787SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv A comparison of two multirecombinated evolutionary algorithms for the job shop scheduling problem
title A comparison of two multirecombinated evolutionary algorithms for the job shop scheduling problem
spellingShingle A comparison of two multirecombinated evolutionary algorithms for the job shop scheduling problem
Minetti, Gabriela F.
Ciencias Informáticas
evolutionary algorithms
multiplicity
Scheduling
Optimization
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 A comparison of two multirecombinated evolutionary algorithms for the job shop scheduling problem
dc.creator.none.fl_str_mv Minetti, Gabriela F.
Salto, Carolina
Alfonso, Hugo
Gallard, Raúl Hector
author Minetti, Gabriela F.
author_facet Minetti, Gabriela F.
Salto, Carolina
Alfonso, Hugo
Gallard, Raúl Hector
author_role author
author2 Salto, Carolina
Alfonso, Hugo
Gallard, Raúl Hector
author2_role author
author
author
dc.subject.none.fl_str_mv Ciencias Informáticas
evolutionary algorithms
multiplicity
Scheduling
Optimization
topic Ciencias Informáticas
evolutionary algorithms
multiplicity
Scheduling
Optimization
dc.description.none.fl_txt_mv 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.
I Workshop de Agentes y Sistemas Inteligentes (WASI)
Red de Universidades con Carreras en Informática (RedUNCI)
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.
publishDate 2000
dc.date.none.fl_str_mv 2000-10
dc.type.none.fl_str_mv info:eu-repo/semantics/conferenceObject
info:eu-repo/semantics/publishedVersion
Objeto de conferencia
http://purl.org/coar/resource_type/c_5794
info:ar-repo/semantics/documentoDeConferencia
format conferenceObject
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/23428
url http://sedici.unlp.edu.ar/handle/10915/23428
dc.language.none.fl_str_mv eng
language eng
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1844615813718343680
score 13.070432

Publicaciones similares