Abstract
This paper considers sequencing of n jobs on a single machine. The total-work-content (TWK) due-date assignment method is used to assign a due-date to each job. The objective is to determine the optimal due-date multiple factor so as to minimize a cost function based on the job earliness and tardiness values. A linear programming (UP) formulation of the problem is constructed and the optimal solution is determined via considering the LP dual problem.