Single machine scheduling with release and due date assignment to minimize the weighted number of late jobs

Abstract

The problem of scheduling n jobs with unequal, in general, processing times and total processing time equal to n on a single machine to minimize the weighted number of late jobs is considered. Each of the n time units with integer end points in the interval [0, n] is to be assigned to a job so that the beginning of the time unit be the release date of the job and the end of the unit be its due date. Two rules for assigning release and due dates are considered. For both, the problem is shown to be NP-hard in the strong sense in the nonpreemptive case even for equal job weights, and solvable in O( n) time in the preemptive case.