Graphplan [Blum & Furst] has proved a popular and successful basis for a succession of extensions. In this paper, we explore the extent to which its representation can be used for planning with soft resource constraints. We present a new algorithm called Fuzzy Resource Constraints Graphplan (FRCGP). In the process of graph expansion, according to the satisfaction degree that the user requires, our algorithm cut the branches low in request directly, which will speed up the graph expansion and solution extraction. It can solve not only the problems that graphplan does, but also the problems with fuzzy resource constraints. These soft resource constraints are defined through fuzzy intervals. This representation allows us a flexible representation and handling of resource information. It's able to represent the preferences of the user when he relaxes a resource constraint. It has more expressive ability than before.