A note on single machine scheduling subject to stochastic breakdowns with regular cost functions

We addresses the single machine scheduling subject to stochastic breakdowns with regular cost functions. Both the preempt-resume version and preempt-repeat version problems are examined by analysis method. Importantly, the SPT Policy for the preempt-resume version problem is extended to the preempt-repeat version problem with uptimes no memory.