Article ID Journal Published Year Pages File Type
6905778 Applied Soft Computing 2014 7 Pages PDF
Abstract

- 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.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computer Science Applications
Preview
A memetic algorithm for the re-entrant permutation flowshop scheduling problem to minimize the makespan
Authors
, , , , ,