The due date assignment scheduling problem with the deteriorating jobs and delivery time

This paper considers the single machine scheduling problem with three different due dates in which the actual processing time of the job is a simple deterioration function of the starting time. The goal is to minimize the total costs that contain the earliness, tardiness and due date. We prove that these problems are polynomial time solvable, and we propose the corresponding algorithms to obtain the optimal sequence and due date.

Automated summary

This paper discusses the single machine scheduling problem with three different due dates, where the actual processing time of the job deteriorates as the starting time increases. The goal is to minimize total costs by considering earliness, tardiness, and due date. The study proves that these problems can be solved in polynomial time and proposes algorithms to obtain the optimal sequence and due date.