The Generalized Resource Constrained Project Scheduling Problem (GRPSP) is the generalization of the Resource Constrained Project Scheduling Problem (RCPSP) where activities are replaced by events. The resource is renewable but an event can produce or consume resources. The objective function remains the makespan. The aim of this talk is to show the connections between RPSCP and GRCPSP in order to bring tools for solving the GRCPSP. At first we recall some similar models of literature as the project scheduling with inventory constraints of Neumann and Schwindt and the financing problem of Carlier and Rinnooy Kan. Next we describe polynomial algorithms based on lists for building solutions of the GRCPSP. Finally we describe how to model the one machine sequencing problem and the cumulative scheduling problem by GRCPSP. It permits to intro duce three lower bounds for GRPSP which are reported.