Experimental investigation of heuristics for resource-constrained project scheduling: An update

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

809 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.

A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem (2010, background): “As Kolisch and Hartmann (2006) stated, one schedule corresponds to (at most) one start time assignment per activity, as done by a SGS.”
A survey of variants and extensions of the resource-constrained project scheduling problem (2010, methodology): “Those papers focus on methods for the RCPSP (see Hartmann and Kolisch [81], Kolisch and Hartmann [108, 109]) and a few common variants (see Brucker [29], Brucker et al. [31], Herroelen et al. [88], Herroelen [85], Kolisch and Padman [111], Özdamar and Ulusoy [146] and Tavares [172]).”
Chemical-Reaction-Inspired Metaheuristic for Optimization (2010, methodology): “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.”