This paper introduces an original algebraic approach to differential evolution (DE) algorithms for combinatorial search spaces. An abstract algebraic differential mutation for generic combinatorial spaces is defined by exploiting the concept of a finitely generated group. This operator is specialized for the permutations space by means of an original randomized bubble sort algorithm. Then, a discrete DE algorithm is derived for permutation problems and it is applied to the permutation flowshop scheduling problem with the total flowtime criterion. Other relevant components of the proposed algorithm are: a crossover operator for permutations, a novel biased selection strategy, a heuristic-based initialization, and a memetic restart procedure. Extensive experimental tests have been performed on a widely accepted benchmark suite in order to analyze the dynamics of the proposed approach and to compare it with the state-of-the-art algorithms. The experimental results clearly show that the proposed algorithm reaches state-of-the-art performances and, most remarkably, it is able to find some new best known results. Furthermore, the experimental analysis on the impact of the algorithmic components shows that the two main contributions of this paper, i.e., the discrete differential mutation and the biased selection operator, greatly contribute to the overall performance of the algorithm.