论文信息 - Single‐machine scheduling subject to stochastic breakdowns

Single‐machine scheduling subject to stochastic breakdowns

We provide several examples of one‐machine problems in which the minimization of expected cost subject to stochastic breakdowns of the machine can be successfully attacked analytically. In particular for the weighted flow‐time model, we derive strong bounds on the difference between the optimal static policy and the WSPT policy and discuss an example in which the WSPT policy is not optimal.

[1] Kevin D. Glazebrook,et al. Methods for the Evaluation of Permutations as Strategies in Stochastic Scheduling Problems , 1983 .

[2] Wayne E. Smith. Various optimizers for single‐stage production , 1956 .

[3] K. Glazebrook. Stochastic scheduling with order constraints , 1976 .

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

[5] 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.

[6] Mark Brown,et al. BOUNDS, INEQUALITIES, AND MONOTONICITY PROPERTIES FOR SOME SPECIALIZED RENEWAL PROCESSES' , 1980 .

[7] K. Glazebrook. On stochastic scheduling with precedence relations and switching costs , 1980, Journal of Applied Probability.

[8] S. Ross,et al. Scheduling Jobs Subject to Nonhomogeneous Poisson Shocks , 1980 .

[9] R. Rockafellar,et al. Nonanticipativity and L1-martingales in stochastic optimization problems , 1976 .

[10] Kevin D. Glazebrook,et al. On nonpreemptive strategies in stochastic scheduling , 1981 .

[11] O. Nerman,et al. An alternative proof of Lorden&s renewal inequality , 1986 .

[12] Kevin D. Glazebrook,et al. Scheduling stochastic jobs on a single machine subject to breakdowns , 1984 .