An algorithm, computationally feasible for large problems, has been formulated for sequencing n jobs through a single facility to minimize the number of late jobs. This algorithm is then extended to ...

This is a preview. Log in through your library . Abstract This paper considers the problem of scheduling n jobs, each having a processing time, a due date and a weight, on a single machine to minimize ...