MINIMIZING TOTAL TARDINESS FOR SINGLE MACHINE SEQUENCING

Abstract

We consider the single machine sequencing problem in which each job has a processing time and a due date. The objective is to find a sequence of n jobs which minimizes the sum of the tardiness of each job. We present an O(n log n) MDD (Modified Due Date) rule which satisfies local optimality and show that the MDD rule has a worst-case performance ratio of n/2. The MDD rule is superior to other known O(n log n) heuristics in the sense of worst-case performance.