Abstract: This paper studies single-machine scheduling with a maintenance activity and common due date assignment problem in which the processing time of a job depends on its position in a sequence.The objective functions include the cost of the due date,the total earliness of the scheduled jobs and the total cost of discarded jobs that cannot be completed by their due dates.Polynomial-time dynamic programming algorithm is thus presented.

Key words: single machine scheduling, maintenance activity, common due date, aging effecting