In this paper, we investigate the problem of minimizing makespan in a multistage hybrid flow-shop scheduling with multiprocessor tasks. To generate high-quality approximate solutions to this challenging NP-hard problem, ...