Project Scheduling with Multiple Modes: A Genetic Algorithm
By Sönke Hartmann. Annals of Operations Research, 2001
341 citations recorded by the source corpus.
Subfields: Building and Construction, Management Science and Operations Research
View Paper: https://www.semanticscholar.org/paper/87bca8580f9f1c0e3a3d426754c5942ffd87a554
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Building and Construction
In Management Science and Operations Research
Citations in the corpus
- A survey of variants and extensions of the resource-constrained project scheduling problem (2010, background): “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], Özdamar and Ulusoy [146] and Tavares [172]).”
- A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem (2010, methodology): “According to Alcaraz et al. (2003), this fitness computation revealed better results than the one of Hartmann (2001).”