Common due-date determination and sequencing using tabu search

Tabu Search techniques are adapted to a single-machine scheduling problem where a common due-date for a set of jobs is determined. The problem is to determine an optimal sequence σ* and the associated optimal due-date d* which minimize the sum of weighted earliness and tardiness values. This paper presents a Tabu Search based approach which is more efficient for solving larger problems than any existing solution method.