A memetic algorithm for the re-entrant permutation flowshop scheduling problem to minimize the makespan

- We study a re-entrant permutation flowshop scheduling problem to minimize the makespan.
- We develop a memetic algorithm (MA) to obtain near-optimal solutions for the problem.
- Compared with two existing heuristics and CPLEX, MA is effective and outperforms the two existing heuristics and CPLEX.