Semi-Markov models for single-machine stochastic scheduling problems
A single machine is available to process a collection of stochastic jobs. A class of semi-Markov decision processes is introduced with a view to modelling such phenomenona as machine breakdowns, restrictions on switching between jobs, deadlines and batch processing. The paper looks at the structure of optimal processing strategies and develops procedures for evaluating suboptimal strategies. For those instances where there is a non-empty partial ordering on the job set delimiting the set of possible processing strategies, the problem becomes exceedingly complex. In such cases the paper studies only the performance of strategies which are a fixed permutation of the job set.
- Scheduling stochastic jobs on a single machine subject to breakdowns
- On stochastic machine scheduling with general distributional assumptions
- Optimal sequences in stochastic single machine shops
- Single-machine stochastic scheduling with dependent processing times
- Stochastic scheduling on a single machine subject to multiple breakdowns according to different probabilities
- scientific article; zbMATH DE number 3338194 (Why is no real title available?)
- On Scheduling Chains of Jobs on One Processor with Limited Preemption
- On Single-Machine Scheduling with Precedence Relations and Linear or Discounted Costs
- Stochastic scheduling with order constraints
- Two-armed bandits with a goal, II. Dependent arms
This page was built for publication: Semi-Markov models for single-machine stochastic scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3685552)