Multirecombining random and seed immigrants in evolutionary algorithms to face the shop scheduling problem

In an m-machines n-jobs flow-shop sequencing problem each job consists of m operations and each operation requires a different machine, so n jobs have to be processed in the same sequence on m machines. The processing time of each job on each machine is given. Frequently, the main objective is to fi...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Vilanova, Gabriela, Villagra, Andrea, Pandolfi, Daniel, San Pedro, María Eugenia de, Gallard, Raúl Hector
Formato:	Objeto de conferencia
Lenguaje:	Inglés
Publicado:	2002
Materias:	Ciencias Informáticas evolutionary algorithms multiple crossovers multiple parents flow shop scheduling problem Algorithms Scheduling
Acceso en línea:	http://sedici.unlp.edu.ar/handle/10915/22071
Aporte de:	SEDICI (UNLP) de Universidad Nacional de La Plata

Ejemplares similares

Multirecombination and different representation in evolutionary algorithms for the flow shop scheduling problem
por: Bain, María Elena, et al.
Publicado: (2000)

Parameter control in multirecombinated evolutionary algorithms for the flow shop scheduling problem
por: Vilanova, Gabriela, et al.
Publicado: (2001)

An analysis on selection methods and multirecombination in evolutionary search when solving the job shop scheduling problem
por: Stark, Natalia, et al.
Publicado: (2002)

A comparison of two multirecombinated evolutionary algorithms for the job shop scheduling problem
por: Minetti, Gabriela F., et al.
Publicado: (2000)

Inserting knowledge in multirecombined evolutionary algorithms for the flow shop scheduling problem
por: Villagra, Andrea, et al.
Publicado: (2002)

Studs and immigrants in multirecombined evolutionary algorithm to face weighted tardiness scheduling problems
por: Pandolfi, Daniel, et al.
Publicado: (2001)

Parallel and sequential evolutionary algorithms for the flow shop scheduling problem
por: Esquivel, Susana Cecilia, et al.
Publicado: (2000)

Multiobjective evolutionary algorithms for job shop scheduling
por: Esquivel, Susana Cecilia, et al.
Publicado: (2001)

A hybrid evolutionary algorithm: multirecombination with priority rule base representation abstract for the job shop scheduling problem
por: Salto, Carolina, et al.
Publicado: (2000)

Facing the job shop scheduling problem wih hybrid evolutionary algorithms
por: Salto, Carolina, et al.
Publicado: (2001)

Influence of crossover operators in evolutionary scheduling under multirecombined schemes
por: San Pedro, María Eugenia de, et al.
Publicado: (2003)

Combining incest prevention and multiplicity in evolutionary algorithms
por: Minetti, Gabriela F., et al.
Publicado: (2001)

Evolutionary algorithms whit studs and random immigrants to solve E/T scheduling problems
por: San Pedro, María Eugenia de, et al.
Publicado: (2001)

The role of different crossover methods when solving the open shop scheduling problem via a simple evolutionary approach
por: Beraudo, Vanina, et al.
Publicado: (2002)

Incest prevention and multicore combinated evolutionary algorithms for the job shop scheduling problem
por: Salto, Carolina, et al.
Publicado: (2001)

Multirecombinated evolutionary algorithms to solve multiobjective job shop scheduling
por: Esquivel, Susana Cecilia, et al.
Publicado: (2000)

Adaptability of multirecombinated evolutionary algorithms to changing common due dates
por: Pandolfi, Daniel, et al.
Publicado: (2001)

Hybrid evolutionary algorithms to solve scheduling problems
por: Minetti, Gabriela F., et al.
Publicado: (2002)

Solving the flow shop scheduling problem under evolutionary approaches
por: Vilanova, Gabriela, et al.
Publicado: (2001)

Adding problem-specific knowledge in evolutionary algorithms to solve W-T scheduling problems
por: San Pedro, María Eugenia de, et al.
Publicado: (2002)

Multiplicity of parents and crossovers, the stud and the neh heuristic for searching the optimal makespan in fssp
por: Esquivel, Susana Cecilia, et al.
Publicado: (2001)

Different evolutionary approaches to solve the flow shop scheduling problem
por: Esquivel, Susana Cecilia, et al.
Publicado: (2001)

A study of genotype and phenotype distributions in hybrid evolutionary algorithms to solve the flow shop scheduling problem
por: Minetti, Gabriela F., et al.
Publicado: (2002)

A multirecombinative evolutionary approach to solve the parallel task scheduling problem
por: Esquivel, Susana Cecilia, et al.
Publicado: (2000)

A genetic approach using direct representation of solution for the parallel task scheduling problem
por: Esquivel, Susana Cecilia, et al.
Publicado: (2001)

Solving unrestricted parallel machine scheduling problems via evolutionary algorithms
por: Gatica, Claudia Ruth, et al.
Publicado: (2003)

Solving the single machine scheduling problem with sequence-dependent set-up times as a TSP via evolutionary algorithms
por: Minetti, Gabriela F., et al.
Publicado: (2001)

Incorporating tabu search for local search into evolutionary algorithms to solve the job shop scheduling problem
por: Fernandez, Natalia, et al.
Publicado: (2001)

Studying the parallel task scheduling problem with conventional and evolutionary algorithms
por: Gatica, Claudia Ruth, et al.
Publicado: (2001)

Upgrading evolutionary algorithms through multiplicity for multiobjective optimization in job shop scheduling problems
por: Esquivel, Susana Cecilia, et al.
Publicado: (2001)

Evolutionary approaches for the parallel task scheduling problem : the representation issue
por: Esquivel, Susana Cecilia, et al.
Publicado: (2001)

A Simple Differential Evolution Algorithm to Solve the Flexible Job Shop Scheduling Problem
por: Morero, Franco, et al.
Publicado: (2019)

Multiple parents, multiple crossovers and incest prevention in evolutionary computation
por: Alfonso, Hugo, et al.
Publicado: (1999)

Evolutionary optimization of due date based objectives in unrestricted identical parallel machine scheduling problems
por: Ferretti, Edgardo, et al.
Publicado: (2004)

On-line multi-threaded Scheduling
por: Feuerstein, E., et al.

On-line multi-threaded Scheduling
Publicado: (2003)

Contrasting two MCMP alternatives in evolutionary algorithms to solve the job shop scheduling problem
por: Stark, Natalia, et al.
Publicado: (2001)

An evolutionary approach to the parallel task scheduling problem
por: Esquivel, Susana Cecilia, et al.
Publicado: (1999)

Applying MILP-based algorithms to automated job-shop scheduling problems in aircraft-part manufacturing
por: Aguirre, A.M., et al.
Publicado: (2013)

Incest prevention and multirecombination in evolutionary algorithms to deal with the flow shop scheduling problem
por: Bain, María Elena, et al.
Publicado: (2000)