Single-Machine Scheduling with Accelerating Learning Effects

Abstract EN

Scheduling with learning effects has been widely studied.

However, there are situations where the learning effect might accelerate.

In this paper, we propose a new model where the learning effect accelerates as time goes by.

We derive the optimal solutions for the single-machine problems to minimize the makespan, total completion time, total weighted completion time, maximum lateness, maximum tardiness, and total tardiness.