This paper considers a project scheduling problem with the objective of minimizing resource availability costs appealed to finish all activities before the deadline. There are finishstart type precedence relations among the activities which require some kinds of renewable resources. We predigest the process of solving the resource availability cost problem(RACP) by using start time of each activity to code the schedule. Then, a novel heuristic algorithm is proposed to make the process of looking for the best solution efficiently. And then pseudo particle swarm optimization(PPSO) combined with PSO and path relinking procedure is presented to solve the RACP. Finally, comparative computational experiments are designed and the computational results show that the proposed method is very effective to solve RACP. This paper considers a project scheduling problem with the objective of minimizing resource availability costs appealed to finish all activities before the deadline. There are finishstart type precedence relations among the activities which require some kinds of renewable resources. We predigest the process of solving the resource availability Then, a novel heuristic algorithm is proposed to make the process of looking for the best solution efficiently. And then pseudo particle swarm optimization (PPSO) combined with PSO and Finally, comparative computational experiments are designed and the computational results show that the proposed method is very effective to solve RACP.