In this paper a heuristic procedure for a resource constrained project scheduling problem with multiple crashable modes is presented. A similar heuristic procedure by Ahn and Erengue was recently introduced, but the procedure assumes the resource capacities constant over the project life. The Procedure of this paper is able to deal with the resource capacities varying over the project life. The computational results with a set of 110 test problems demonstrate the efficacy of the heuristic procedure.