Single Machine Group Scheduling Problems with the Effects of Deterioration and Learning

This paper studies the single-machine scheduling problem with the effects of deterioration and learning under group consumption, where the processing time of a job is defined by the function of the starting time and position in the group. Based on the analysis of properties and polynomial algorithms, it can be shown that both the single-machine makespan minimization problem and the total resource minimization problem under the group consumption are polynomially solvable, even though the deterioration and learning effect on job processing time is introduced.