Minimizing the number of late jobs in a stochastic setting using a chance constraint
Journal of Scheduling
Robust scheduling on a single machine to minimize total flow time
Computers and Operations Research
Robotic clusters: Multi-robot systems as computer clusters
Robotics and Autonomous Systems
| Hi-index | 0.00 |
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 time solution for any stochastically ordered processing times.