This paper deals with the Event Scheduling Problem with Consumption and Production of Resources called ESPCPR. This problem is an extension of the Resource Constrained Project Scheduling Problem (RCPSP) where we have the property to produce or consume the resources. The aim of this paper is to introduce for ESPCPR three new lower bounds whose calculation serves two goals. First, they can help in deleting useless nodes in a branch-and-bound tree. Second, they may help in evaluating the efficiency of heuristic methods when optimal solutions are not available.