This study deals with a m-machine flowshop problem with the DeJong's learning effect, in which m is the number of machines. The goal is to identify a permutation that minimizes the maximum completion time, i.e., the makespan. We derive several properties, lower bounds, and initial upper bounds, and then propose a branch-and-bound algorithm. Additionally, we develop several heuristic algorithms. Computational tests are presented to evaluate the effectiveness and performance of thees algorithms.
Zhang et al. (Fri,) studied this question.