Flowshop Scheduling Problems with a Position-Dependent Exponential Learning Effect

Abstract EN

We consider a permutation flowshop scheduling problem with a position-dependent exponential learning effect.

The objective is to minimize the performance criteria of makespan and the total flow time.

For the two-machine flow shop scheduling case, we show that Johnson’s rule is not an optimal algorithm for minimizing the makespan given the exponential learning effect.

Furthermore, by using the shortest total processing times first (STPT) rule, we construct the worst-case performance ratios for both criteria.

Finally, a polynomial-time algorithm is proposed for special cases of the studied problem.