An intelligent hybrid meta-heuristic for solving a case of no-wait two-stage flexible flow shop scheduling problem with unrelated parallel machines

This paper addresses the problem of no-wait two-stage flexible flow shop scheduling problem (NWTSFFSSP) considering unrelated parallel machines, sequence-dependent setup times, probable reworks and different ready times to actualize the problem. The performance measure used in this study is minimizing maximum completion time (makespan). Because of the complexity of addressed problem, we propose a novel intelligent hybrid algorithm called hybrid algorithm (HA)] based on imperialist competitive algorithm (ICA) which are combined with simulated annealing (SA), variable neighborhood search (VNS) and genetic algorithm (GA) for solving the mentioned problem. The hybridization is carried out to overcome some existing drawbacks of each of these three algorithms and also for increasing the capability of ICA. To achieve reliable results, Taguchi approach is used to define robust parameters' values for our proposed algorithm. A simulation model is developed to study the performance of our proposed algorithm against ICA, SA, VNS, GA and ant colony optimization (ACO). The results of the study reveal the relative superiority of HA studied. In addition, potential areas for further researches are highlighted.