Incest prevention and multirecombination in evolutionary algorithms to deal with the flow shop scheduling problem

Scheduling concerns the allocation of limited resources for tasks over time. It is a process of making decisions that has, as a goal, the optimization of one or more objectives. Frequently, the main objective to be minimized is the completion time of the last job to abandon the system, which is call...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Bain, María Elena, Vilanova, Gabriela, Gallard, Raúl Hector
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2000
Materias:
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/23454
Aporte de:
id I19-R120-10915-23454
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
genetic diversity
premature convergence
incest prevention
spellingShingle Ciencias Informáticas
evolutionary algorithms
genetic diversity
premature convergence
incest prevention
Bain, María Elena
Vilanova, Gabriela
Gallard, Raúl Hector
Incest prevention and multirecombination in evolutionary algorithms to deal with the flow shop scheduling problem
topic_facet Ciencias Informáticas
evolutionary algorithms
genetic diversity
premature convergence
incest prevention
description Scheduling concerns the allocation of limited resources for tasks over time. It is a process of making decisions that has, as a goal, the optimization of one or more objectives. Frequently, the main objective to be minimized is the completion time of the last job to abandon the system, which is called makespan. In many production systems a number of operations must be done on every job and often these operations have to be done in the same order on all jobs. This scheduling approach is known as the Flow Shop Scheduling Problem (FSSP). The present paper discusses the new multi-recombinative method and shows the performance of enhanced evolutionary approaches under permutation representation combined with a successfull previous approach proposed by another researchers, the extended incest prevention (EIP), consist of maintaining information about ancestors within the chromosome and modifying the selection for reproduction in order to impede mating of in di viduals belonging to the same "family", for a predefined number of generations. Results of the methods proposed here are contrasted with those obtained under previous evolutionary approaches to the FSSP.
format Objeto de conferencia
Objeto de conferencia
author Bain, María Elena
Vilanova, Gabriela
Gallard, Raúl Hector
author_facet Bain, María Elena
Vilanova, Gabriela
Gallard, Raúl Hector
author_sort Bain, María Elena
title Incest prevention and multirecombination in evolutionary algorithms to deal with the flow shop scheduling problem
title_short Incest prevention and multirecombination in evolutionary algorithms to deal with the flow shop scheduling problem
title_full Incest prevention and multirecombination in evolutionary algorithms to deal with the flow shop scheduling problem
title_fullStr Incest prevention and multirecombination in evolutionary algorithms to deal with the flow shop scheduling problem
title_full_unstemmed Incest prevention and multirecombination in evolutionary algorithms to deal with the flow shop scheduling problem
title_sort incest prevention and multirecombination in evolutionary algorithms to deal with the flow shop scheduling problem
publishDate 2000
url http://sedici.unlp.edu.ar/handle/10915/23454
work_keys_str_mv AT bainmariaelena incestpreventionandmultirecombinationinevolutionaryalgorithmstodealwiththeflowshopschedulingproblem
AT vilanovagabriela incestpreventionandmultirecombinationinevolutionaryalgorithmstodealwiththeflowshopschedulingproblem
AT gallardraulhector incestpreventionandmultirecombinationinevolutionaryalgorithmstodealwiththeflowshopschedulingproblem
bdutipo_str Repositorios
_version_ 1764820466145427457