This paper considers sequencing of n jobs on a single machine. The total-work-content-power (TWK-P) due-date assignment method is used to assign due-dates to jobs. The objective is to determine the optimal due-date multiple factor so as to minimize a cost function based on the due-date multiple and job earliness, and tardiness values. A linear programming (LP) formulation of the problem is proposed and the optimal solution is determined via considering the LP dual problem.
ASJC Scopus subject areas
- Modelling and Simulation
- Computational Theory and Mathematics
- Computational Mathematics