This paper deals with the resource constrained project scheduling problem, which consists of scheduling a set of activities with minimal duration that are subject to precedence constraints and the limited availability of resources. In addition to these constraints, we also take into account work space limitations and storage capacity, which are major challenges in construction projects. To solve this NP-Hard problem, we proposed an algorithm based on an evolutive lower bound which permits the branching procedure to be driven with more efficiency whilst minimizing the problem size by updating the time horizon all along iterations. Tests on instances based on project examples generated from the PSPLib library are presented.