Single machine earliness–tardiness scheduling problem with additional penalties about due window

Due date assignment and sequencing problem is one of the scheduling fields about due window. This paper is concerned with single machine problem about due window, the objective function concludes earliness–tardiness penalties and additional penalties. It is assumed that earliness–tardiness penalties will not occur if a job is completed within the due window. Otherwise, earliness–tardiness penalties will occur if a job is completed outside the due window. The optimal common due date is assigned, and the optimal sequencing is also given. A polynomial-time algorithm is presented for determining the optimal scheduling. Finally, a numerical example is provided to illustrate the effectiveness of our results.