A Review on Scheduling Problems for Minimizing the Number of Late Jobs

In this paper, scheduling problems for minimizing the number of late jobs are examined. First, possible real world applications are listed to motivate the interests in these problems. Next, a problem classification scheme is provided. Then, a brief review of the problems, both deterministic and stochastic, that have been effectively solved, is presented. When stochastic scheduling problems are dealt with, they can be further classified in terms of the probabilistic distributions of due dates. After the review, we point out that there still remain some research problems whose solutions would have a beneficial impact on the practice. These would include analytical complexity, alternative performance measures, and parallel machines.