A Note on Deteriorating Jobs and Learning in Single-Machine Scheduling Problems

Abstract

In this note, we investigate the effects of deterioration and learning in single-machine scheduling problems. Although the learning effect and the concept of deteriorating jobs have been extensively studied, they have never been considered simultaneously. It is shown in several examples that the optimal schedule of the problem may be different from that of the classical one. Nevertheless, the makespan and the total flow time minimization problems remain polynomial solvable. Key words: scheduling; single machine; learning effect; deteriorating jobs JEL classification: C69 1.