To solve the resource conflicts between different activities, a new neighborhood search algorithm based on topological sorting was proposed. Two operations namely jumping move and micro-move were designed to update code and get better results. Use cases with different scales from Project Scheduling Problem Library to test the performances of the algorithm. The results showed that the algorithm had searched excellent solutions. Use the algorithm proposed to solve the case in the literature, the results showed that the algorithm had its superiority. Test the proposed algorithm with different parameters and analyze the influences of parameter setting on algorithm performance.