In this paper, the notions of scheme simplification ordering are introduced, and a new method for proving termination rewriting is given. At the same time, scheme recursive path ordering is discussed, and the upper and lower extension of rewriting rule w.r.t. scheme set are defined. By this, finally we show how to prove termination of rewriting using scheme recursive path ordering.