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 ...

The algorithm starts with four-job sequences and from these constructs five-job sequences; from the five-job sequences, six-job sequences are constructed, and so on. At each stage, a large fraction of ...