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

• Published in: European journal of operational research Vol. 174; no. 1; pp. 23 - 37
• Main Authors: Kolisch, Rainer, Hartmann, Sönke
• Format: Journal Article
• Language: English
• Published: Amsterdam Elsevier B.V 01.10.2006; Elsevier; Elsevier Sequoia S.A
• Series: European Journal of Operational Research
• Subjects: Applied sciences; Computational evaluation; Exact sciences and technology; Flows in networks. Combinatorial problems; Heuristic; Heuristics; Mathematical problems; Operational research and scientific management; Operational research. Management science; Project management; Project scheduling; Resource constraints; Scheduling; Scheduling, sequencing; Studies; SGS, Schedule generation scheme; Resource constraints; LST, Latest start time (priority rule); LR, Lagrange Relaxation; Heuristics; VNS, Variable neighborhood search; Computational evaluation; TS, Tabu search; FBI; MP, Multi-pass; LFT, Latest finish time (priority rule); WCS, Worst case slack (priority rule); Project scheduling; MIP, Mixed integer program; GA, Genetic algorithm; Project management; Resource constraint; Heuristic method; Mixed integer programming; Scheduling
• ISSN: 0377-2217; 1872-6860
• DOI: 10.1016/j.ejor.2005.01.065

This paper considers heuristics for the well-known resource-constrained project scheduling problem (RCPSP). It provides an update of our survey which was published in 2000. We summarize and categorize a large number of heuristics that have recently been proposed in the literature. Most of these heuristics are then evaluated in a computational study and compared on the basis of our standardized experimental design. Based on the computational results we discuss features of good heuristics. The paper closes with some remarks on our test design and a summary of the recent developments in research on heuristics for the RCPSP.