This paper studies the single-machine due-date assignment problem with past-sequence-dependent setup times (denoted by \(ST_{psd}\)). Under common due-date (denoted by CON-DD) assignment, slack due-date (denoted by SLK-DD) and different due-date (denoted by DIF-DD) assignment, the objective function is to minimize the linear weighted sum of earliness-tardiness, number of early and delayed jobs, and due-date cost. Optimal properties of the problem is given and then prove that the problem can be solved in polynomial time. Three extensions to the problem are also offered by assuming position-dependent, time-dependent, position-and-time-dependent processing times.

本文研究了与过去序列相关的设置时间（用\（ST_ {psd} \）表示）的单机到期日期分配问题。在普通到期日（由CON-DD表示）分配，松弛到期日（由SLK-DD表示）和不同的到期日（由DIF-DD表示）分配下，目标函数是使的线性加权和最小化。迟到，早期和延迟的工作数量以及到期成本。给出了问题的最优性质，然后证明了该问题可以在多项式时间内解决。通过假定与位置有关，与时间有关，与位置和时间有关的处理时间，还提供了对该问题的三种扩展。