Managing a patient waiting list with time-dependent priority and adverse events

Daiki Min; Yuehwern Yih

RAIRO - Operations Research - Recherche Opérationnelle (2014)

  • Volume: 48, Issue: 1, page 53-74
  • ISSN: 0399-0559

Abstract

top
This paper addresses the problem of managing a waiting list for elective surgery to decide the number of patients selected from the waiting list and to schedule them in accordance with the operating room capacity in the next period. The waiting list prioritizes patients not only by their initial urgency level but also by their waiting time. Selecting elective surgery patients requires a balance between the waiting time for urgent patients and that for less urgent patients. The problem is formulated as an infinite horizon Markov Decision Process. Further, the study proposes a scheduling procedure based on structural properties of an optimal policy by taking a sampling-based finite horizon approximation approach. Finally, we examine the performance of the policy under various conditions.

How to cite

top

Min, Daiki, and Yih, Yuehwern. "Managing a patient waiting list with time-dependent priority and adverse events." RAIRO - Operations Research - Recherche Opérationnelle 48.1 (2014): 53-74. <http://eudml.org/doc/275010>.

@article{Min2014,
abstract = {This paper addresses the problem of managing a waiting list for elective surgery to decide the number of patients selected from the waiting list and to schedule them in accordance with the operating room capacity in the next period. The waiting list prioritizes patients not only by their initial urgency level but also by their waiting time. Selecting elective surgery patients requires a balance between the waiting time for urgent patients and that for less urgent patients. The problem is formulated as an infinite horizon Markov Decision Process. Further, the study proposes a scheduling procedure based on structural properties of an optimal policy by taking a sampling-based finite horizon approximation approach. Finally, we examine the performance of the policy under various conditions.},
author = {Min, Daiki, Yih, Yuehwern},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {waiting list management; time-dependent priority; adverse events while waiting; Markov decision process},
language = {eng},
number = {1},
pages = {53-74},
publisher = {EDP-Sciences},
title = {Managing a patient waiting list with time-dependent priority and adverse events},
url = {http://eudml.org/doc/275010},
volume = {48},
year = {2014},
}

TY - JOUR
AU - Min, Daiki
AU - Yih, Yuehwern
TI - Managing a patient waiting list with time-dependent priority and adverse events
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 2014
PB - EDP-Sciences
VL - 48
IS - 1
SP - 53
EP - 74
AB - This paper addresses the problem of managing a waiting list for elective surgery to decide the number of patients selected from the waiting list and to schedule them in accordance with the operating room capacity in the next period. The waiting list prioritizes patients not only by their initial urgency level but also by their waiting time. Selecting elective surgery patients requires a balance between the waiting time for urgent patients and that for less urgent patients. The problem is formulated as an infinite horizon Markov Decision Process. Further, the study proposes a scheduling procedure based on structural properties of an optimal policy by taking a sampling-based finite horizon approximation approach. Finally, we examine the performance of the policy under various conditions.
LA - eng
KW - waiting list management; time-dependent priority; adverse events while waiting; Markov decision process
UR - http://eudml.org/doc/275010
ER -

References

top
  1. [1] J.M. Alden and R.L. Smith, Rolling horizon procedures in nonhomogeneous Markov Decision Processes. Oper. Res.40 (1992) 183–194. Zbl0762.90085MR1170275
  2. [2] D.P. Bertsekas, Dynamic programming and optimal control, Vol. 2, 2nd edition. Athena Scientific, Belmont, MA (2007). Zbl1083.90044
  3. [3] D.P. Bertsekas and D.A. Castanon, Rollout algorithms for stochastic scheduling problems. J. Heuristics5 (1999) 89–108. Zbl0997.90037
  4. [4] T. Cheevaprawatdomrong and R.L. Smith, Infinite horizon production scheduling in time-varying systems under stochastic demand. Oper. Res.52 (2004) 105–115. Zbl1165.90473MR2066243
  5. [5] H.S. Chang, M.C. Fu, J. Hu and S.I. Marcus, An adaptive sampling algorithm for solving Markov Decision Processes. Oper. Res.53 (2005) 126–139. Zbl1165.90672MR2131102
  6. [6] F. Dexter, A. Macario and R.D. Traub, Which algorithm for scheduling add-on elective cases maximizes operating room utilization? Use of bin packing algorithms and fuzzy constraints in operating room management. Anesthesia and Analgesia 90 (1999) 980–988. 
  7. [7] J. Everett, A decision support simulation model for the management of an elective surgery waiting system. Health Care Manag. Sci.5 (2002) 89–95. 
  8. [8] Y. Gerchak, D. Gupta and M. Henig, Reservation planning for elective surgery under uncertain demand for emergency surgery. Manag. Sci.42 (1996) 321–334. Zbl0884.90106
  9. [9] L. Green, S. Savin and B. Wang, Managing patient service in a diagnostic medical facility. Oper. Res.54 (2006) 11–25. Zbl1167.90562
  10. [10] D. Gupta, Surgical Suites Operations Management. Prod. Oper. Manag.16 (2007) 689–700. 
  11. [11] E. Hans, G. Wullink, M.V. Houdenhoven and G. Kazemier, Robust surgery loading. Eur. J. Oper. Res.185 (2008) 1038–1050. Zbl1178.90229
  12. [12] O. Hernandez-Lerma and J.B. Lasserre, Error bounds for rolling horizon policies in discrete-time Markov control processes. IEEE Trans. Autom. Control35 (1990) 1118–1124. Zbl0724.93087MR1073256
  13. [13] J. Hurst and L. Sicilliani, Tackling excessive waiting times for elective surgery: A comparison of policies in twelve OECD countries. OECD Health Work. Pap. 2003 (2003). 
  14. [14] M. Kearns, Y. Mansour and A.Y. Ng, A sparse sampling algorithm for near-optimal planning in large Markov Decision Processes. Machine Learn.49 (2002) 193–208. Zbl1014.68150
  15. [15] M. Lans, E. Hans, J.L. Hurink, G. Wullink, M. Houdenhoven and G. Kazemier, Anticipating urgent surgery in operating room departments, Working Paper, University of Twente, The Netherlands (2006). 
  16. [16] L. Liu and X. Liu, Dynamic and static job allocation for multi-server systems. IIE Trans.30 (1998) 845–854. 
  17. [17] N. Liu, S. Ziya and V.G. Kulkarni, Dynamic scheduling of outpatient appointments under patient no-shows and cancellations. Manufacturing and Service Oper. Manag. Published online (2009). 
  18. [18] W.S. Lovejoy and Y. Li, Hospital operating room capacity expansion. Manag. Sci.48 (2002) 1369–1387. 
  19. [19] A.D. MacCormick, W.G. Collecutt and B.R. Parry, Prioritizing patients for elective surgery: A systematic review. ANZ J. Surgery, 73 (2003) 633–642. 
  20. [20] E. Marcon, S. Kharraja and G. Simonnet, The operating theatre planning by the follow-up of the risk of no realization. Int. J. Prod. Econ.85 (2003) 83–90. 
  21. [21] D. Min and Y. Yih, An elective surgery scheduling problem considering patient priority. Comput. Oper. Res.37 (2010) 1091–1099. Zbl1178.90158
  22. [22] P.M. Mullen, Prioritizing waiting lists: how and why? Eur. J. Oper. Res.150 (2003) 32–45. Zbl1112.90337
  23. [23] K. Muthuraman and M. Lawley, A stochastic overbooking model for outpatient clinical scheduling with no-shows. IIE Trans.40 (2008) 820–837. 
  24. [24] M. Olivares, C. Terwiesch and L. Cassorla, Structural estimation of the newsvendor model: an application to reserving operating room time. Manag. Sci.54 (2008) 41–55. 
  25. [25] J. Patrick, M. Puterman and M. Queyranne, Dynamic multi-priority patient scheduling for a diagnostic resource. Oper. Res.56 (2008) 1507–1525. Zbl1167.90675MR2485332
  26. [26] W.B. Powell, Approximate dynamic programming: Solving the curses of dimensionality. John Wiley and Sons, Inc., New York (2007). Zbl1242.90002MR2347698
  27. [27] I.E. Schochetman and R.L. Smith, Infinite horizon optimization. Math. Oper. Res.14 (1989) 559–574. Zbl0677.90084MR1008429
  28. [28] L.R. Smith and Q.R. Zhang, Infinite horizon production planning in time-varying systems with convex production and inventory costs. Manag. Sci.44 (1998) 1313–1320. Zbl0989.90052
  29. [29] B. Sobolev, L. Kuramoto, A. Levy and R. Hayden, Cumulative incidence for wait-list death in relation to length of queue for coronary-artery bypass grafting: a cohort study. J. Cardiothoracic Surgery1 (2006) 1–10. 
  30. [30] B. Sobolev and L. Kuramoto, Analysis of waiting-time data in health services research. New York, Springer (2007). 
  31. [31] B. Sobolev, V. Sanchez, L. Kuramoto, A.R. LevyM. Schechter and M. FitzGerald, Evaluation of booking systems for elective surgery using simulation experiments. Healthcare Policy 3 (2008) 113–124. 
  32. [32] D.P. Strum, L.G. Varga, J.H. May and G. Bashein, Surgical suite utilization and capacity planning: a minimal cost analysis model. J. Medical Systems21 (1997) 309–322. 
  33. [33] A. Testi, E. Tanfani and G. Torre, A three-phase approach for operating theatre schedules. Health Care Manag. Sci.10 (2007) 163–172. 
  34. [34] S. Thompson, M. Nunez, R. Garfinkel and M.D. Dean, Efficient short-term allocation and reallocation of patients to floors of a hospital during demand surges. Oper. Res.57 (2009) 261–273. 
  35. [35] C. Vasilakis, B. Sobolev, L. Kuramoto and A. Levy, A simulation study of scheduling clinic appointments in surgical care: individual surgeon versus pooled lists. J. Oper. Res. Soc.58 (2007) 202–211. Zbl1146.90472

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.