Single-Machine Scheduling Problems with Decreasing Linear Deterioration and Learning Effects

This paper considers a scheduling model with decreasing linear deterioration and learning effects simultaneously, where the actual processing time of a job is a function depends not only on the start time of the job, but also on the job's scheduled position in the sequence. It shows that the optimal schedule for the single-machine scheduling problem to minimize makespan and total complete time under the proposed model can be solved in polynomial time. It further shows that the problem to minimize the total lateness has polynomial-time solution under some agreeable conditions.