Abstract
We look at single-machine scheduling problems with breakdowns and stochastic processing times. We present static list algorithms to minimize the maximum lateness, to minimize the total weighted completion time and to maximize the number of on-time jobs (based on either expected completion time or a minimum success probability of being
... read more