Simulation-based approximate policy iteration with generalized logistic functions

DOI10.1287/IJOC.2015.0645MaRDI QIDQ3458754zbMATH OpenOpenAlexFDO

Authors Antoine Sauré, Jonathan Patrick, 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

approximate dynamic programminglogistic approximationpatient schedulingsimulation

Mathematics Subject Classification ID

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

Recommendations

• Advance patient appointment scheduling
• Dynamic Multipriority Patient Scheduling for a Diagnostic Resource
• Approximate dynamic programming for capacity allocation in the service industry
• A simulation based approximate dynamic programming approach to multi-class, multi-resource surgical scheduling
• An approximate dynamic programming approach to the admission control of elective patients

Cited in

(7)

• Optimization and approximation methods for dynamic appointment scheduling with patient choices
• 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
• Approximate dynamic programming for capacity allocation in the service industry
• Advance patient appointment scheduling
• Automatic generation of efficient policy alternatives via simulation-optimization
• An approximate dynamic programming approach for <scp>production‐delivery</scp> scheduling under non‐stationary demand

This page was built for publication: Simulation-based approximate policy iteration with generalized logistic functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3458754)