Pages that link to "Item:Q1806711"

The following pages link to Rollout algorithms for stochastic scheduling problems (Q1806711):

Displaying 29 items.

• Solving stochastic resource-constrained project scheduling problems by closed-loop approximate dynamic programming (Q319710) (← links)
• Perspectives of approximate dynamic programming (Q333093) (← links)
• Minimum and worst-case performance ratios of rollout algorithms (Q415370) (← links)
• Sensor control for multi-object state-space estimation using random finite sets (Q620590) (← links)
• Parallelization strategies for rollout algorithms (Q812417) (← links)
• Looking ahead with the pilot method (Q816423) (← links)
• A 2-OPT procedure to reduce total inspection time in a serial inspection process (Q877228) (← links)
• Single-pass and approximate dynamic-programming algorithms for order acceptance and capacity planning (Q964848) (← links)
• A POMDP framework for coordinated guidance of autonomous UAVs for multitarget tracking (Q965333) (← links)
• Partially observable Markov decision process approximations for adaptive sensing (Q977009) (← links)
• A novel parallel quantum genetic algorithm for stochastic job shop scheduling (Q1018336) (← links)
• A survey on metaheuristics for stochastic combinatorial optimization (Q1024034) (← links)
• An approximate dynamic programming approach for the vehicle routing problem with stochastic demands (Q1027533) (← links)
• Approximate receding horizon approach for Markov decision processes: average reward case (Q1414220) (← links)
• Analysis of a rollout approach to sequencing problems with stochastic routing applications (Q1415519) (← links)
• Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands (Q1579026) (← links)
• Faster rollout search for the vehicle routing problem with stochastic demands and restocking (Q1651700) (← links)
• A rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programs (Q1698902) (← links)
• A unified framework for stochastic optimization (Q1719609) (← links)
• Planning horizons based proactive rescheduling for stochastic resource-constrained project scheduling problems (Q1991259) (← links)
• Rollout approach to sensor scheduling for remote state estimation under integrity attack (Q2165967) (← links)
• Simulation-based rolling horizon scheduling for operating theatres (Q2225649) (← links)
• An approximate dynamic programming approach to project scheduling with uncertain resource availabilities (Q2247268) (← links)
• Average-case performance of rollout algorithms for knapsack problems (Q2349849) (← links)
• Augmenting priority rule heuristics with justification and rollout to solve the resource-constrained project scheduling problem (Q2482379) (← links)
• Dynamic programming and suboptimal control: a survey from ADP to MPC (Q2511993) (← links)
• New Rollout Algorithms for Combinatorial Optimization Problems (Q4709749) (← links)
• Quadratic approximate dynamic programming for input‐affine systems (Q5409145) (← links)
• Dynamic parcel pick-up routing problem with prioritized customers and constrained capacity via lower-bound-based rollout approach (Q6109553) (← links)