Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem

By Sönke Hartmann, Rainer Kolisch. European Journal of Operational Research, 2000

528 citations recorded by the source corpus.

Subfields: Industrial and Manufacturing Engineering, Management Science and Operations Research

View Paper: https://www.semanticscholar.org/paper/95da251138e628e3397ae8453697c07d2c3bde1b

How researchers see this paper

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

In Industrial and Manufacturing Engineering

In Management Science and Operations Research

Citations in the corpus

Experimental investigation of heuristics for resource-constrained project scheduling: An update (2006, methodology): “The paper at hand is in line with research that has been performed by the authors in [37] and [26].”
A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem (2010, background): “Introduced by Holland (1975), genetic algorithms (GAs) use techniques and procedures inspired by evolutionary biology to solve complex optimization problems.”
An integrated survey of deterministic project scheduling (2001, methodology): “[181] Hartmann S, Kolisch R.”
A survey of variants and extensions of the resource-constrained project scheduling problem (2010, methodology): “For a brief discussion of the similarities and differences between both representations, we refer to Kolisch and Padman [111].”
Project Scheduling with Multiple Modes: A Genetic Algorithm (2001, background): “For all RS ρ values, the deviation of the GA is approximately nine times lower than that of the truncated branch-and-bound algorithm. a deviation from optimum for J ≤ 20 and from lower bound for J = 30 b not all optimal solutions for J = 30 are currently known Table 6: Information on the impact of o”
Chemical-Reaction-Inspired Metaheuristic for Optimization (2010, unknown): “Comprehensive surveys about the heuristics on solving RCPSP can be found in [ 43 ] and [44].”
Project scheduling with finite or infinite number of activity processing modes - A survey (2011, background): “Hartmann and Kolisch (2000) and Kolisch and Hartmann (2006) provide an extensive comparison of computational results obtained by the best heuristic algorithms known to date.”