On minimizing completion time variance on a single machine subject to stochastic breakdowns

This paper addresses a stochastic scheduling problem in which n jobs are to be processed on a single machine. The machine is subject to stochastic breakdowns, characterized by a generalized Poisson process. The objective is to find the schedule to minimize the expected variance of completion times. The deterministic equivalent of the stochastic scheduling problem is developed. Optimal sequences are derived for the special case with identical processing times.