In this paper, we study the m-machine ( \(m\ge 3\) ) permutation flow shop scheduling in which the processing time of a job depends not only on the sum of actual processing times of previous jobs but also on its job-dependent truncation parameter, i.e., the general truncated learning effects. The goal is to find a sequence so as to minimize the makespan, we prove that this problem is NP-hard. Two simple heuristics are proposed and their worst-case bounds are presented. We also propose a branch-and-bound algorithm and some heuristics to solve this problem. Further, computational experiments are conducted to determine the efficiency of the proposed algorithms.
