Approximate dynamic programming approaches for appointment scheduling with patient preferences
作者：
Highlights：
• We study an appointment scheduling problem with patient preferences.
• Attributes of the model are studied theoretically and experimentally.
• Approximate dynamic programming approaches are developed.
摘要
•We study an appointment scheduling problem with patient preferences.•Attributes of the model are studied theoretically and experimentally.•Approximate dynamic programming approaches are developed.
论文关键词：Appointment scheduling,Health service,Dynamic programming,Markov processes
论文评审过程：Received 3 April 2017, Revised 12 September 2017, Accepted 6 February 2018, Available online 23 February 2018, Version of Record 16 March 2018.
论文官网地址：https://doi.org/10.1016/j.artmed.2018.02.001
