Research on m‐machine flow shop scheduling with truncated learning effects

The permutation flow shop problems with truncated exponential sum of logarithm processing times based and position‐based learning effects are considered in this study. The objective is to minimize makespan and total weighted completion time, respectively. Several heuristics and a branch‐and‐bound algorithm are proposed in this paper. The tight worst‐case bounds of some simple heuristics are also given. Numerical experiments are tested to evaluate the performance of the heuristics and branch‐and‐bound algorithm.