Due-date assignment and single-machine resource allocation scheduling with deteriorating jobs

This paper investigated due-date assignment and single-machine resource allocation scheduling problems with position-dependent deteriorating jobs. Two generally resource consumption functions, the linear resource consumption function and the convex resource consumption function, were explored. The objectives were to determining the optimal due-date, the optimal resource allocation, and the optimal job sequence so that the cost function associated with the job's due-date and the processing time reduction as well as job absolute value in lateness will be minimized. We showed that the proposed problems are polynomial time solvable.