Rollout algorithms for stochastic scheduling problems
From MaRDI portal
Publication:1806711
DOI10.1023/A:1009634810396zbMath0997.90037MaRDI QIDQ1806711
Dimitri P. Bertsekas, David A. Castanon
Publication date: 20 December 1999
Published in: Journal of Heuristics (Search for Journal in Brave)
dynamic programming; computational experiments; Monte Carlo simulation; heuristic approach; rollout; deterministic quiz problems; stochastic quiz problems; stochastic scheduling problems; suboptimal solution algorithms
90C15: Stochastic programming
90C59: Approximation methods and heuristics in mathematical programming
90B36: Stochastic scheduling theory in operations research
90C39: Dynamic programming
Related Items
New Rollout Algorithms for Combinatorial Optimization Problems, Parallelization strategies for rollout algorithms, Looking ahead with the pilot method, A 2-OPT procedure to reduce total inspection time in a serial inspection process, Single-pass and approximate dynamic-programming algorithms for order acceptance and capacity planning, A POMDP framework for coordinated guidance of autonomous UAVs for multitarget tracking, Partially observable Markov decision process approximations for adaptive sensing, A novel parallel quantum genetic algorithm for stochastic job shop scheduling, A survey on metaheuristics for stochastic combinatorial optimization, An approximate dynamic programming approach for the vehicle routing problem with stochastic demands, Approximate receding horizon approach for Markov decision processes: average reward case, Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands, Augmenting priority rule heuristics with justification and rollout to solve the resource-constrained project scheduling problem
