Heuristics for the Common Due Date Weighted Tardiness Problem

Abstract

In this paper we consider the single machine “common due date weighted tardiness problem.” Initially the problem is related to other versions of the single machine total weighted tardiness problem. Several heuristics for the problem are discussed. Three “simple” heuristics are proposed and shown to have arbitrarily bad worst case performance. A fourth heuristic is then proposed and shown to have a worst case performance bound of 2.