Resource-constrained project scheduling by simulated annealing

This paper presents a new adaptation of the simulated annealing algorithm for solving non-preemptive resource-constrained project scheduling problems in which resources are limited but renewable from period to period. This algorithm is able to handle single-mode and multi-mode problems and to optimize different objective functions. Statistical experiments show the efficiency of the proposed algorithm even in comparison of some Tabu search heuristics.