Group Scheduling Problems with Time-Dependent and Position-Dependent DeJong’s Learning Effect

In this paper, we introduce a group scheduling model with time-dependent and position-dependent DeJong’s learning effect. The objectives of scheduling problems are to minimize makespan, the total completion time, and the total weighted completion time, respectively. We show that the problems remain solvable in polynomial time under the proposed model