This chapter looks at project scheduling problems with storage resources. Activities can produce or consume resources at their start or at their completion. We consider projects composed of events subject to precedence constraints and resource constraints. We describe briefly the exact methods of Neumann and Schwindt and of Laborie, which solve the problem when stocks of resources have to be between minimum and maximum levels. We then suppose that there are no maximum stocks. We report the shifting algorithm which solves in polynomial time the financing problem where resources are produced at given dates. We also explain how an earliest schedule corresponding to a linear order of consumption events can be built. The enumeration of linear orders then becomes sufficient for building an exact method.