Appointment Scheduling Under Patient Preference and No-Show Behavior

Motivated by the rising popularity of electronic appointment booking systems, we develop appointment scheduling models that take into account the patient preferences regarding when they would like to be seen. The service provider dynamically decides which appointment days to make available for the patients. Patients arriving with appointment requests may choose one of the days offered to them or leave without an appointment. Patients with scheduled appointments may cancel or not show up for the service. The service provider collects a “revenue” from each patient who shows up and incurs a “service cost” that depends on the number of scheduled appointments. The objective is to maximize the expected net “profit” per day. We begin by developing a static model that does not consider the current state of the scheduled appointments. We give a characterization of the optimal policy under the static model and bound its optimality gap. Building on the static model, we develop a dynamic model that considers the current state of the scheduled appointments, and we propose a heuristic solution procedure. In our computational experiments, we test the performance of our models under the patient preferences estimated through a discrete choice experiment that we conduct in a large community health center. Our computational experiments reveal that the policies we propose perform well under a variety of conditions.

Suggested Citation

Download full text from publisher

References listed on IDEAS

  1. Guillermo Gallego & Garrett van Ryzin, 1994. " Optimal Dynamic Pricing of Inventories with Stochastic Demand over Finite Horizons ," Management Science, INFORMS, vol. 40(8), pages 999-1020, August.
  2. Wen-Ya Wang & Diwakar Gupta, 2011. " Adaptive Appointment Systems with Patient Preferences ," Manufacturing & Service Operations Management, INFORMS, vol. 13(3), pages 373-389, July.
  3. Kalyan Talluri & Garrett van Ryzin, 2004. " Revenue Management Under a General Discrete Choice Model of Consumer Behavior ," Management Science, INFORMS, vol. 50(1), pages 15-33, January.
  4. Hole, Arne Risa, 2008. " Modelling heterogeneity in patients' preferences for the attributes of a general practitioner appointment ," Journal of Health Economics, Elsevier, vol. 27(4), pages 1078-1094, July.

Most related items

  1. Agrawal, Deepak & Pang, Guodong & Kumara, Soundar, 2023. " Preference based scheduling in a healthcare provider network ," European Journal of Operational Research, Elsevier, vol. 307(3), pages 1318-1335.
  2. Van-Anh Truong, 2015. " Optimal Advance Scheduling ," Management Science, INFORMS, vol. 61(7), pages 1584-1597, July.
  3. Ahmadi-Javid, Amir & Jalali, Zahra & Klassen, Kenneth J, 2017. " Outpatient appointment systems in healthcare: A review of optimization studies ," European Journal of Operational Research, Elsevier, vol. 258(1), pages 3-34.
  4. Dan Zhang & Larry Weatherford, 2017. " Dynamic Pricing for Network Revenue Management: A New Approach and Application in the Hotel Industry ," INFORMS Journal on Computing, INFORMS, vol. 29(1), pages 18-35, February.
  5. Yongbo Xiao & Yan Zhu, 2016. " Value management of diagnostic equipment with cancelation, no‐show, and emergency patients ," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(4), pages 287-304, June.
  6. Wen-Ya Wang & Diwakar Gupta, 2011. " Adaptive Appointment Systems with Patient Preferences ," Manufacturing & Service Operations Management, INFORMS, vol. 13(3), pages 373-389, July.
  7. Paat Rusmevichientong & Mika Sumida & Huseyin Topaloglu, 2020. " Dynamic Assortment Optimization for Reusable Products with Random Usage Durations ," Management Science, INFORMS, vol. 66(7), pages 2820-2844, July.
  8. Yu Zhang & Vidyadhar G. Kulkarni, 2017. " Two-day appointment scheduling with patient preferences and geometric arrivals ," Queueing Systems: Theory and Applications, Springer, vol. 85(1), pages 173-209, February.
  9. W. Zachary Rayfield & Paat Rusmevichientong & Huseyin Topaloglu, 2015. " Approximation Methods for Pricing Problems Under the Nested Logit Model with Price Bounds ," INFORMS Journal on Computing, INFORMS, vol. 27(2), pages 335-357, May.
  10. Dan Zhang, 2011. " An Improved Dynamic Programming Decomposition Approach for Network Revenue Management ," Manufacturing & Service Operations Management, INFORMS, vol. 13(1), pages 35-52, April.
  11. Paola Cappanera & Filippo Visintin & Carlo Banditori & Daniele Feo, 2019. " Evaluating the long-term effects of appointment scheduling policies in a magnetic resonance imaging setting ," Flexible Services and Manufacturing Journal, Springer, vol. 31(1), pages 212-254, March.
  12. Sebastian Koch & Jochen Gönsch & Michael Hassler & Robert Klein, 2016. " Practical decision rules for risk-averse revenue management using simulation-based optimization ," Journal of Revenue and Pricing Management, Palgrave Macmillan, vol. 15(6), pages 468-487, December.
  13. Jingui Xie & Weifen Zhuang & Marcus Ang & Mabel C. Chou & Li Luo & David D. Yao, 2021. " Analytics for Hospital Resource Planning—Two Case Studies ," Production and Operations Management, Production and Operations Management Society, vol. 30(6), pages 1863-1885, June.
  14. Guillermo Gallego & Huseyin Topaloglu, 2014. " Constrained Assortment Optimization for the Nested Logit Model ," Management Science, INFORMS, vol. 60(10), pages 2583-2601, October.
  15. Guang Li & Paat Rusmevichientong & Huseyin Topaloglu, 2015. " The d -Level Nested Logit Model: Assortment and Price Optimization Problems ," Operations Research, INFORMS, vol. 63(2), pages 325-342, April.
  16. Miao Bai & Bjorn Berg & Esra Sisikoglu Sir & Mustafa Y. Sir, 2023. " Partially partitioned templating strategies for outpatient specialty practices ," Production and Operations Management, Production and Operations Management Society, vol. 32(1), pages 301-318, January.
  17. Dogru, Ali K. & Melouk, Sharif H., 2019. " Adaptive appointment scheduling for patient-centered medical homes ," Omega, Elsevier, vol. 85(C), pages 166-181.
  18. Wuyang Yuan & Lei Nie & Xin Wu & Huiling Fu, 2018. " A dynamic bid price approach for the seat inventory control problem in railway networks with consideration of passenger transfer ," PLOS ONE, Public Library of Science, vol. 13(8), pages 1-23, August.
  19. Paat Rusmevichientong & Zuo-Jun Max Shen & David B. Shmoys, 2010. " Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint ," Operations Research, INFORMS, vol. 58(6), pages 1666-1680, December.
  20. Guillermo Gallego & Michael Z. F. Li & Yan Liu, 2020. " Dynamic Nonlinear Pricing of Inventories over Finite Sales Horizons ," Operations Research, INFORMS, vol. 68(3), pages 655-670, May.

More about this item

Keywords

Statistics

Corrections

All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:62:y:2014:i:4:p:794-811 . See general information about how to correct material in RePEc.

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

Please note that corrections may take a couple of weeks to filter through the various RePEc services.