A note on a partial search algorithm for the single-machine optimal common due-date assignment and sequencing problem (Q913649)

The problem considered consists in assigning a common-due-date to a set of simultaneously available jobs and sequencing them on a single-machine. The objective is to find an optimal combination of the due-date value and job sequence to minimize a penalty function based on the weighted sum of job earliness and tardiness values. Being a follow-up study to an earlier work of the author [ibid. 14, 537-542 (1987; Zbl 0634.90030)], this note presents a new algorithm which is shown to be significantly more efficient than the previous one for solving the problem.