Single machine scheduling problems with deteriorating jobs

This paper considers the single machine scheduling problems with deteriorating jobs, i.e. jobs whose processing times are a decreasing linear function of their starting time. It is assumed that jobs have the different basic processing time and same decreasing rate. Based on the analysis of problems, the optimal algorithms are presented for the problems to minimize the sum of earliness penalties subject to no tardy jobs, to minimize the resource consumption with makespan constraints and to minimize the makespan with the total resource consumption constraints.