Scheduling stochastic jobs on a single machine subject to breakdowns

1 June 1984

journal article
research article
Published by Wiley in Naval Research Logistics Quarterly

Vol. 31 (2) , 251-264
https://doi.org/10.1002/nav.3800310207

Abstract

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.

Keywords

This publication has 14 references indexed in Scilit:

Methods for the Evaluation of Permutations as Strategies in Stochastic Scheduling Problems
Management Science, 1983
Optimal strategies for families of alternative bandit processes
IEEE Transactions on Automatic Control, 1983
On the evaluation of fixed permutations as strategies in stochastic scheduling
Stochastic Processes and their Applications, 1982
On nonpreemptive strategies in stochastic scheduling
Naval Research Logistics Quarterly, 1981
On stochastic scheduling with precedence relations and switching costs
Journal of Applied Probability, 1980
Generalized semi-Markov decision processes
Journal of Applied Probability, 1979
Multiple feedback at a single-server station
Stochastic Processes and their Applications, 1977
Stochastic scheduling with order constraints
International Journal of Systems Science, 1976
On Scheduling Chains of Jobs on One Processor with Limited Preemption
SIAM Journal on Computing, 1975
Single Facility Sequencing with Random Execution Times
Operations Research, 1965