Rollout algorithms for stochastic scheduling problems
From MaRDI portal
Recommendations
- Analysis of a rollout approach to sequencing problems with stochastic routing applications
- On a stochastic sequencing and scheduling problem
- scientific article; zbMATH DE number 1060044
- scientific article; zbMATH DE number 826383
- Rearrangement, Majorization and Stochastic Scheduling
- Optimal stochastic scheduling
- scientific article; zbMATH DE number 3906216
- Rollout algorithms for combinatorial optimization
- A stochastic batching and scheduling problem
Cited in
(29)- An approximate dynamic programming approach to project scheduling with uncertain resource availabilities
- Sensor control for multi-object state-space estimation using random finite sets
- Looking ahead with the pilot method
- Parallelization strategies for rollout algorithms
- Analysis of a rollout approach to sequencing problems with stochastic routing applications
- Augmenting priority rule heuristics with justification and rollout to solve the resource-constrained project scheduling problem
- Quadratic approximate dynamic programming for input-affine systems
- A POMDP framework for coordinated guidance of autonomous UAVs for multitarget tracking
- Minimum and worst-case performance ratios of rollout algorithms
- A 2-OPT procedure to reduce total inspection time in a serial inspection process
- Faster rollout search for the vehicle routing problem with stochastic demands and restocking
- New Rollout Algorithms for Combinatorial Optimization Problems
- Average-case performance of rollout algorithms for knapsack problems
- A survey on metaheuristics for stochastic combinatorial optimization
- Rollout approach to sensor scheduling for remote state estimation under integrity attack
- A unified framework for stochastic optimization
- Dynamic parcel pick-up routing problem with prioritized customers and constrained capacity via lower-bound-based rollout approach
- Dynamic programming and suboptimal control: a survey from ADP to MPC
- Solving stochastic resource-constrained project scheduling problems by closed-loop approximate dynamic programming
- Approximate receding horizon approach for Markov decision processes: average reward case
- A novel parallel quantum genetic algorithm for stochastic job shop scheduling
- Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands
- Perspectives of approximate dynamic programming
- A rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programs
- Partially observable Markov decision process approximations for adaptive sensing
- Simulation-based rolling horizon scheduling for operating theatres
- Planning horizons based proactive rescheduling for stochastic resource-constrained project scheduling problems
- An approximate dynamic programming approach for the vehicle routing problem with stochastic demands
- Single-pass and approximate dynamic-programming algorithms for order acceptance and capacity planning
This page was built for publication: Rollout algorithms for stochastic scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1806711)
