Stochastic scheduling with order constraints
From MaRDI portal
Cited in
(19)- The performance of forwards induction policies
- Independently Expiring Multiarmed Bandits
- New results for generalized bandit problems
- Branching Bandit Processes
- Bounds on optimal values in stochastic scheduling
- Semi-Markov models for single-machine stochastic scheduling problems
- Decomposable jump decision processes
- On scheduling influential stochastic tasks on a single machine
- On the evaluation of fixed permutations as strategies in stochastic scheduling
- On stochastic scheduling problems with due dates
- Scheduling stochastic jobs with increasing hazard rate on identical parallel machines
- The archievable region method in the optimal control of queueing systems; formulations, bounds and policies
- Un ordonnancement dynamique de tâches stochastiques sur un seul processeur
- Stochastic scheduling: a short history of index policies and new approaches to index generation for dynamic resource allocation
- On the evaluation of strategies for stochastic scheduling problems with order constraints
- Stochastic scheduling and forwards induction
- A General Framework for Stochastic One-machine Scheduling Problems with Zero Release Times and No Partial Ordering
- Competing Markov decision processes
- On the evaluation of strategies for branching bandit processes
This page was built for publication: Stochastic scheduling with order constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4108132)