Minimizing total earliness and tardiness for common due date single-machine scheduling with an unavailability interval (Q1793403): Difference between revisions

Summary: This paper addresses the problem of scheduling \(n\) independent jobs on a single machine with a fixed unavailability interval, where the aim is to minimize the total earliness and tardiness (TET) about a common due date. Two exact methods are proposed for solving the problem: mixed integer linear programming formulations and a dynamic programming based method. These methods are coded and tested intensively on a large data set and the results are analytically compared. Computational experiments show that the dynamic programming method is efficient in obtaining the optimal solutions and no problems due to memory requirement.