Approximate dynamic programming methods for advance patient scheduling
This dissertation studies an advance multi-priority patient scheduling problem. Patrick et al. (2008) formulated a version of this problem as a discounted infinite-horizon Markov decision process (MDP) and studied it using a linear programming method based on an affine value function approximation....
Main Author: | Sauré, Antoine |
---|---|
Language: | English |
Published: |
University of British Columbia
2012
|
Online Access: | http://hdl.handle.net/2429/43448 |
Similar Items
-
Approximate dynamic programming methods for advance patient scheduling
by: Sauré, Antoine
Published: (2012) -
Approximate dynamic programming methods for advance patient scheduling
by: Sauré, Antoine
Published: (2012) -
An approximate dynamic programming approach to solving dynamic oligopoly models
by: Farias, Vivek F., et al.
Published: (2012) -
Algorithms of approximate dynamic programming for hydro scheduling
by: Parvez Iram, et al.
Published: (2020-01-01) -
Performance comparison of approximate dynamic programming techniques for dynamic stochastic scheduling
by: Yasin Göçgün
Published: (2021-05-01)