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_x000D_ scheduling problems. Although the learning effect and the concept of deteriorating jobs have_x000D_ been extensively studied, they have never been considered simultaneously. It is shown in several_x000D_ examples that the optimal schedule of the problem may be different from that of the classical_x000D_ one. Nevertheless, the makespan and the total flow time minimization problems remain_x000D_ polynomial solvable.