A note on single-machine scheduling problems with the effects of deterioration and learning

Abstract

This paper studies two single-machine scheduling problems with the effect of deterioration and learning. In this model, the processing times of jobs are defined as functions of their starting times and positions in a sequence. For the following two objective functions: the weighted sum of completion times and the maximum lateness, this paper proposes two heuristics according to the corresponding single machine problems without learning effect. This paper also gives the worst-case error bound for the heuristics and provides computational results to evaluate the performance of the heuristics.