This paper presents a new adaptation of the simulated annealing algori
thm 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 pr
oblems and to optimize different objective functions. Statistical expe
riments show the efficiency of the proposed algorithm even in comparis
on to some Tabu search heuristics.