A High Performing Memetic Algorithm for the Flowshop Scheduling Problem With …

This paper considers minimizing makespan for a blocking flowshop scheduling problem, which has important application in a variety of modern industries. A constructive heuristic is first presented to generate a good initial solution by combining the existing profile fitting (PF) approach and Nawaz–Enscore–Ham (NEH) heuristic in an effective way. Then, a memetic algorithm (MA) is proposed in…