Maintenance Activity Single- Machines Scheduling and Due-Date Assignment Simultaneously

Abstract. Present work deals with analysis maintenance activity single-machine scheduling and due-date assignment simultaneously. The objective is to find the optimal maintenance position as well as the optimal location of the common due-date for minimizing the total of earliness, tardiness and due-date costs. We introduce a polynomial 0 (n 4) time solution for the problem. To solve the scheduling problem addressed in this work, we have to determine the job sequence, the common due-date, and the location of a maintenance activity. We also present two special cases of the problem and show that they can be optimally solved by a lower order algorithm