On the evaluation of fixed permutations as strategies in stochastic scheduling |
| |
| Authors: | KD Glazebrook |
| |
| Institution: | Department of Statistics, University of Newcastle-upon-Tyne, Newcastle-upon-Tyne, NE1 7RU, U.K. |
| |
| Abstract: | A general model is proposed for the stochastic version of the single-machine allocation problem. Sufficient conditions are given to ensure that there is an optimal strategy given by a fixed permutation of the job set. Additional results are given for an important special case of the general model involving simple jobs. The paper concludes with material concerning the evaluation of fixed permutations as strategies under conditions more general than the sufficient conditions mentioned above. |
| |
| Keywords: | Dynamic programming non-preemptive strategies switching costs Markov decision processes stochastic scheduling |
| 本文献已被 ScienceDirect 等数据库收录！ |
