论文信息 - Minimizing makespan on a single machine subject to random breakdowns

Minimizing makespan on a single machine subject to random breakdowns

We investigate optimal sequencing policies for the expected makespan problem with an unreliable machine, where jobs have to be reprocessed in their entirety if preemptions occur because of breakdowns. We identify a class of uptime distributions under which LPT minimizes expected makespan.

[1] Esther Frostig,et al. A Note on Stochastic Scheduling on a Single Machine Subject to Breakdown–The Preemptive Repeat Model , 1991, Probability in the Engineering and Informational Sciences.

[2] Michael Pinedo,et al. Scheduling: Theory, Algorithms, and Systems , 1994 .

[3] Alexander H. G. Rinnooy Kan,et al. Single machine flow-time scheduling with a single breakdown , 1989, Acta Informatica.

[4] Wei Li,et al. Stochastic scheduling on a single machine subject to multiple breakdowns according to different probabilities , 1995, Oper. Res. Lett..

[5] A.H.G. Rinnooy Kan,et al. Single‐machine scheduling subject to stochastic breakdowns , 1990 .

[6] Michael Pinedo,et al. A Note on Stochastic Scheduling on a Single Machine Subject to Breakdown and Repair , 1988, Probability in the Engineering and Informational Sciences.

[7] Michael Pinedo,et al. A note on minimizing the expected makespan in flowshops subject to breakdowns , 1995 .

[8] Kevin D. Glazebrook,et al. On Nonpreemptive Policies for Stochastic Single-Machine Scheduling with Breakdowns , 1991, Probability in the Engineering and Informational Sciences.

[9] Kevin D. Glazebrook,et al. Evaluating the effects of machine breakdowns in stochastic scheduling problems , 1987 .