Common due date scheduling problem with separate earliness and tardiness penalties

This paper considers the problem of finding an optimal schedule and a common due date for a set of jobs, in a static single machine system. The scheduling criterion is the minimization of the weighted sum of earliness and tardiness values. Different weights are considered as the earliness penalty and tardiness penalty, for each job. A branching procedure is presented for finding an optimal solution. An almost optimal heuristic is also presented.