Simulation-Based Approximate Policy Iteration with Generalized Logistic Functions

DOI10.1287/ijoc.2015.0645zbMath1328.90155OpenAlexW1955062487MaRDI QIDQ3458754

Jonathan Patrick, Antoine Sauré, Martin L. Puterman

Publication date: 21 December 2015

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/76a9cb667d5aba9f4ed74579e7b9fad350b52c00

zbMATH Keywords

simulationapproximate dynamic programmingpatient schedulinglogistic approximation

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Queues and service in operations research (90B22) Dynamic programming (90C39)

Related Items (4)

Optimization and approximation methods for dynamic appointment scheduling with patient choices ⋮ An approximate dynamic programming approach for <scp>production‐delivery</scp> scheduling under non‐stationary demand ⋮ Dynamic multi-priority, multi-class patient scheduling with stochastic service times ⋮ An aggregation-based approximate dynamic programming approach for the periodic review model with random yield

This page was built for publication: Simulation-Based Approximate Policy Iteration with Generalized Logistic Functions