A discrete artificial bee colony algorithm (DABC) is proposed for solving the permutation flow shop scheduling problem (PFSSP) with minimum makespan criterion. Firstly, the NEH heuristic was combined the random initialization to the population for quality and diversity. Secondly, a new individual enhancement scheme is proposed to combine the swap, insert, inverse and adjacent exchange operation. Third, the fast local search is used to enhancing the individuals. Fourth, the pair-wise based local search is used to enhance the global optimal solution and escape from local minimum. Lastly, simulations and comparisons based on PFSSP benchmarks are carried out, which show that our algorithm is effectively and efficiently for solving the PFSSP.