Scheduling plays an important role in the development and success of the project; this has always been one of the main issues considered in operations and management science researches. Another reason for the focus of much research into it is the difficult nature of this problem. Therefore, special techniques and methods have been proposed to solve this problem. On the other hand, in order to intensify sanctions on foreign delaying projects, timely completion of projects has been accelerated. Therefore, attention to project robustness subject to project managements. In this article, a real issue is scheduled for a robust scheduling model of a refinery project. Since project scheduling has resource constraints such NP-Hard problems, simulated annealing algorithm was proposed to solve this problem. In order to validate the model, 4 problems with small size were chosen and the solutions obtained by the proposed algorithms were compared with the exact solution obtained by Lingo8 software. The results showed that the proposed algorithm is efficient and convergent to the optimal solution.