A Robust Genetic Algorithm for Resource Allocation in Project Scheduling

By Javier Alcaraz, Concepción Maroto. Annals of Operations Research, 2001

296 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Experimental investigation of heuristics for resource-constrained project scheduling: An update (2006, methodology): “Alcaraz and Maroto [1] develop a genetic algorithm based on the activity list representation and the serial SGS.”
TWO NEW ROBUST GENETIC ALGORITHMS FOR THE FLOWSHOP SCHEDULING PROBLEM (2006, background): “mutation operators, as well as the probabilities by which they are applied (see Alcaraz and Maroto [1]).”
A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version (2003, methodology): “The recent benchmark results [2,16,24] show that the genetic algorithms proposed by Alcaraz and Maroto [2] and Hartman [14], and our SA are the best performing methods currently available for RCPSP.”
A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem (2010, methodology): “Afterwards several authors as Alcaraz and Maroto (2001), Valls et al.”