Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties

A single machine scheduling problem with distinct due windows to minimize total weighted earliness and tardiness is examined. A mathematical formulation of the problem is first presented and several important properties are studied to facilitate the solution process. An optimal timing algorithm is then proposed to determine completion times for each job in a given job sequence. A Tabu search procedure is employed together with the optimal timing algorithm to generate job sequences and final schedules. Computational experiments indicate that the performance of the proposed approach is acceptable, especially for the instances of large size.