Scheduling stochastic jobs on a single machine subject to breakdowns
Tóm tắt
A single machine is available to process a collection of stochastic jobs. There may be technological constraints on the job set. The machine sometimes breaks down. Costs are incurred and rewards are earned during processing. We seek strategies for processing the jobs which maximize the total expected reward earned.
Từ khóa
Tài liệu tham khảo
Gittins J. C., 1979, Bandit Processes and Dynamic Allocation Indices, Journal of the Royal Statistical Society, Series B, 41, 148
Glazebrook K. D., 1982, Myopic Strategies for Bayesian Models in Stochastic Scheduling, Opsearch, 19, 160
Nash P. “Optimal Allocation of Resources between Research Projects ” Ph. D. Thesis Cambridge University 1973.
Ross S. M., 1970, Applied Probability Models with Optimization Applications
Sevcik K. C. “The Use of Service Time Distributions in Scheduling ” Technical Report CSRG‐14 University of Toronto 1972.
Weber R. R. “Optimal Organisation of Multi‐Server Systems ” Ph. D. Thesis Cambridge University 1979.