Since existing [k+n,k,d] systematic permutation codes which can correct limited-magnitude errors lack encoding and decoding procedures in the Chebyshev metric, an encoding algorithm for these systematic permutation codes is proposed by using the ranking and unranking mappings in the symmetric group and the interleaving technology of (n,M,d) permutation codes in the Chebyshev metric. Moreover, a decoding method of [k+n,k,d] systematic permutation codes is presented by using the the ranking and unranking mappings in the symmetric group and the projection technology for (n,M,d) permutation codes in the Chebyshev metric. The correctness of the proposed encoding and decoding methods for systematic permutation codes is illustrated by some calculation examples.