Worst‐case behavior of simple sequencing rules in flow shop scheduling with general position‐dependent learning effects

A real industrial production phenomenon, referred to as learning effects, has drawn increasing attention. However, most research on this issue considers only single machine problems. Motivated by this limitation, this paper considers flow shop scheduling problems with a general position‐dependent learning effects. By the general position‐dependent learning effects, we mean that the actual processing time of a job is defined by a general non‐increasing function of its scheduled position. The objective is to minimize one of the five regular performance criteria, namely, the total completion time, the makespan, the total weighted completion time, the total weighted discounted completion time, and the sum of the quadratic job completion times. We present heuristic algorithms by using the optimal permutations for the corresponding single machine scheduling problems. We also analyze the worst‐case bound of our heuristic algorithms.