Minimizing the Number of Tardy Jobs with Stochastically-Ordered Processing Times by Dan Trietsch and Kenneth R. Baker 2 February 2006 Revised 21 November 2006 Abstract We consider the single-machine sequencing model with stochastic processing times and the problem of minimizing the number of stochastically tardy jobs. In general, this problem is NP-hard. Recently, however, van den Akker and Hoogeveen found some special cases that could be solved in polynomial time. We generalize their findings by providing a polynomial solution for any stochastically ordered processing times.