Multiobjetive optimization co-evolution for the job shop scheduling problem

Autores
Esquivel, Susana Cecilia; Ferrero, Sergio W.; Gallard, Raúl Hector
Año de publicación
1999
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
A job shop is a facility that produces goods according to specified production plans under several domain-dependent constraints. Job Shop Scheduling (JSS) attempts to provide optimal schedules. Cornmon variables to optimize are total completion time (makespan), machine idleness, lateness and total weighted completion time. According to this variables different objectives can be devised. Multiobjective optimization, also known as vector-valued eriteria or multieriteria optimization, have long been used in many applieation areas where a problem involve multiple objeetives, often eonflieting, to be met or optimized. Co-evolution, as an extended evolutive model, ean be applied to solve multieriteria optimization for the JSS problem using a plain aggregative approach. This presentation will show the design, implementations and results of a co-evolutive approaeh solving a multiobjeetive optimization problem involving the makespan, maehine idleness and total weighted eompletion time as eriteria to be optimized.
Eje: Redes y sistemas inteligentes
Red de Universidades con Carreras en Informática (RedUNCI)
Materia
Ciencias Informáticas
Multiobjetive
ARTIFICIAL INTELLIGENCE
Scheduling
scheduling problem
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/22227
Acceder
id SEDICI_690bc915f739dd0bd7ce5cdf812884ff
oai_identifier_str oai:sedici.unlp.edu.ar:10915/22227
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling Multiobjetive optimization co-evolution for the job shop scheduling problemEsquivel, Susana CeciliaFerrero, Sergio W.Gallard, Raúl HectorCiencias InformáticasMultiobjetiveARTIFICIAL INTELLIGENCESchedulingscheduling problemA job shop is a facility that produces goods according to specified production plans under several domain-dependent constraints. Job Shop Scheduling (JSS) attempts to provide optimal schedules. Cornmon variables to optimize are total completion time (makespan), machine idleness, lateness and total weighted completion time. According to this variables different objectives can be devised. Multiobjective optimization, also known as vector-valued eriteria or multieriteria optimization, have long been used in many applieation areas where a problem involve multiple objeetives, often eonflieting, to be met or optimized. Co-evolution, as an extended evolutive model, ean be applied to solve multieriteria optimization for the JSS problem using a plain aggregative approach. This presentation will show the design, implementations and results of a co-evolutive approaeh solving a multiobjeetive optimization problem involving the makespan, maehine idleness and total weighted eompletion time as eriteria to be optimized.Eje: Redes y sistemas inteligentesRed de Universidades con Carreras en Informática (RedUNCI)1999-05info: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/22227enginfo: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-17T09:38:22Zoai:sedici.unlp.edu.ar:10915/22227Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-17 09:38:22.669SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv Multiobjetive optimization co-evolution for the job shop scheduling problem
title Multiobjetive optimization co-evolution for the job shop scheduling problem
spellingShingle Multiobjetive optimization co-evolution for the job shop scheduling problem
Esquivel, Susana Cecilia
Ciencias Informáticas
Multiobjetive
ARTIFICIAL INTELLIGENCE
Scheduling
scheduling problem
title_short Multiobjetive optimization co-evolution for the job shop scheduling problem
title_full Multiobjetive optimization co-evolution for the job shop scheduling problem
title_fullStr Multiobjetive optimization co-evolution for the job shop scheduling problem
title_full_unstemmed Multiobjetive optimization co-evolution for the job shop scheduling problem
title_sort Multiobjetive optimization co-evolution for the job shop scheduling problem
dc.creator.none.fl_str_mv Esquivel, Susana Cecilia
Ferrero, Sergio W.
Gallard, Raúl Hector
author Esquivel, Susana Cecilia
author_facet Esquivel, Susana Cecilia
Ferrero, Sergio W.
Gallard, Raúl Hector
author_role author
author2 Ferrero, Sergio W.
Gallard, Raúl Hector
author2_role author
author
dc.subject.none.fl_str_mv Ciencias Informáticas
Multiobjetive
ARTIFICIAL INTELLIGENCE
Scheduling
scheduling problem
topic Ciencias Informáticas
Multiobjetive
ARTIFICIAL INTELLIGENCE
Scheduling
scheduling problem
dc.description.none.fl_txt_mv A job shop is a facility that produces goods according to specified production plans under several domain-dependent constraints. Job Shop Scheduling (JSS) attempts to provide optimal schedules. Cornmon variables to optimize are total completion time (makespan), machine idleness, lateness and total weighted completion time. According to this variables different objectives can be devised. Multiobjective optimization, also known as vector-valued eriteria or multieriteria optimization, have long been used in many applieation areas where a problem involve multiple objeetives, often eonflieting, to be met or optimized. Co-evolution, as an extended evolutive model, ean be applied to solve multieriteria optimization for the JSS problem using a plain aggregative approach. This presentation will show the design, implementations and results of a co-evolutive approaeh solving a multiobjeetive optimization problem involving the makespan, maehine idleness and total weighted eompletion time as eriteria to be optimized.
Eje: Redes y sistemas inteligentes
Red de Universidades con Carreras en Informática (RedUNCI)
description A job shop is a facility that produces goods according to specified production plans under several domain-dependent constraints. Job Shop Scheduling (JSS) attempts to provide optimal schedules. Cornmon variables to optimize are total completion time (makespan), machine idleness, lateness and total weighted completion time. According to this variables different objectives can be devised. Multiobjective optimization, also known as vector-valued eriteria or multieriteria optimization, have long been used in many applieation areas where a problem involve multiple objeetives, often eonflieting, to be met or optimized. Co-evolution, as an extended evolutive model, ean be applied to solve multieriteria optimization for the JSS problem using a plain aggregative approach. This presentation will show the design, implementations and results of a co-evolutive approaeh solving a multiobjeetive optimization problem involving the makespan, maehine idleness and total weighted eompletion time as eriteria to be optimized.
publishDate 1999
dc.date.none.fl_str_mv 1999-05
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/22227
url http://sedici.unlp.edu.ar/handle/10915/22227
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_ 1843532047519318016
score 13.001348

Publicaciones similares