Heuristic based genetic algorithms for the re-entrant total completion time flowshop scheduling with learning consideration

Recently, both the learning effect scheduling and re-entrant scheduling have received more attention separately in research community. However, the learning effect concept has not been introduced into re-entrant scheduling in the environment setting. To fill this research gap, we investigate re-entrant permutation flowshop scheduling with a position-based learning effect to minimize the total completion time. Because the same problem without learning or re-entrant has been proved NP-hard, we thus develop some heuristics and a genetic algorithm (GA) to search for approximate solutions. To solve this problem, we first adopt four existed heuristics for the problem; we then apply the same four methods combined with three local searches to solve the proposed problem; in the last stage we develop a heuristic-based genetic algorithm seeded with four good different initials obtained from the second stage for finding a good quality of solutions. Finally, we conduct experimental tests to evaluate the behaviours of all the proposed algorithms when the number of re-entrant times or machine number or learning effect or job size changes