An efficient evolutionary algorithm for the deadline problem in project management

This article presents an efficient evolutionary algorithm applied to the deadline scheduling in project management, a NP-hard problem with major relevance in software engineering and scheduling activities. The evolutionary algorithm has been specifically designed to provide accurate and efficient so...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Galnare, Matías, Nesmachnow, Sergio
Formato:	Objeto de conferencia
Lenguaje:	Inglés
Publicado:	2012
Materias:	Ciencias Informáticas Project management Deadline problem Evolutionary algorithms
Acceso en línea:	http://sedici.unlp.edu.ar/handle/10915/123744 https://41jaiio.sadio.org.ar/sites/default/files/15_ASAI_2012.pdf
Aporte de:	SEDICI (UNLP) de Universidad Nacional de La Plata

Ejemplares similares

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

Evolutionary algorithms to solve the school timetabling problem
por: Fernandez, Natalia, et al.
Publicado: (2002)

A self-adaptive recombination method in evolutionary algorithms for solving epistatic problems
por: Stark, Natalia, et al.
Publicado: (2011)

Evolutionary algorithms to face computer systems management problems
por: Gallard, Raúl Hector, et al.
Publicado: (2000)

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

Evolutionary algorithm for state encoding
por: Skliarova, Iouliia, et al.
Publicado: (2006)

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

Inserting problem-specific knowledge in multirecombined evolutionary algorithms
por: Pandolfi, Daniel, et al.
Publicado: (2002)

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

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

Solving the two dimensional cutting problem using evolutionary algorithms with penalty functions
por: Beraudo, Vanina, et al.
Publicado: (2005)

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

Multirecombining random and seed immigrants in evolutionary algorithms to face the shop scheduling problem
por: Vilanova, Gabriela, et al.
Publicado: (2002)

Cellular memetic algorithms
por: Alba Torres, Enrique, et al.
Publicado: (2005)

Enhancing evolutionary algorithms through recombination and parallelism
por: Gallard, Raúl Hector, et al.
Publicado: (2001)

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

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)

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

Hybrid evolutionary algorithms for the TSP
por: Minetti, Gabriela F., et al.
Publicado: (2001)

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

Adaptability of multirecombinated evolutionary algorithms to changing common due dates
por: Pandolfi, Daniel, 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)

Evolutionary-statistical system for uncertainty reduction problems in wildfires
por: BIanchini, Germán, et al.
Publicado: (2012)

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

A comparison of fitness scallng methods in evolutionary algorithms
por: Bertone, E., et al.
Publicado: (1999)

Biclustering in data mining using a memetic multi-objective evolutionary algorithm
por: Gallo, Cristian Andrés, et al.
Publicado: (2008)

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

Enhancing evolutionary algorithms through recombination and parallelism
por: Gallard, Raúl Hector, et al.
Publicado: (2000)

Parameter control in multirecombinated evolutionary algorithms for the flow shop scheduling problem
por: Vilanova, Gabriela, 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)

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

Cellular memetic algorithms evaluated on SAT
por: Alba Torres, Enrique, et al.
Publicado: (2005)

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

Uncertainty Reduction Method Based on Statistics and Parallel Evolutionary Algorithms
por: Bianchini, Germán, et al.
Publicado: (2011)

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

Managing project uncertainty
por: Cleden, David
Publicado: (2009)

Global and partial function approximation with evolutionary algorithms
por: Kavka, Carlos, et al.
Publicado: (2001)

Improving evolutionary algorithms performance by extending incest prevention
por: Alfonso, Hugo, et al.
Publicado: (1998)

Hybridizing multi-inver-over evolutionary algorithms with tabu search for the symmetric TSP
por: Bermúdez, Carlos, et al.
Publicado: (2001)

A parallel evolutionary algorithm applied to the minimum interference frequency assignment problem
por: Mora, Gerardo, et al.
Publicado: (2006)