We examine the problem of scheduling a given set of jobs on a single machine to minimize total early and tardy costs. Two dispatch priority rules are proposed and tested for this NP-complete problem. These were found to perform far better than known heuristics that ignored early costs. For...

Most scheduling research has considered optimizing a single performance measure (criterion). In this paper we consider the problem of scheduling jobs on a single machine when the desirability of a schedule is evaluated using more than one performance measure. The procedures developed here can be...