Minimizing the number of late jobs in case of stochastic processing times with minimum success probabilities

We consider the single-machine scheduling problem of minimizing the number of late jobs. We omit here one of the standard assumptions in scheduling theory, which is that the processing times are deterministic. Our main message is that in a number of cases the problem with stochastic processing times can be reformulated as a deterministic problem, which is solvable in polynomial time through the famous algorithm by Moore and Hodgson. We firs