Operating Room Staffing and Scheduling

References

• Alstott J, Bullmore E, Plenz D (2014) Powerlaw: A Python package for analysis of heavy-tailed distributions. PLoS One 9(1):e85777.Crossref, Google Scholar
• Bandi C, Bertsimas D (2012) Tractable stochastic analysis in high dimensions via robust optimization. Math. Programming 134(1):1–48.Crossref, Google Scholar
• Batun S, Denton BT, Huschka TR, Schaefer AJ (2011) Operating room pooling and parallel surgery processing under uncertainty. INFORMS J. Comput. 23(2):220–237.Link, Google Scholar
• Benchoff B, Yano CA, Newman A (2017) Kaiser Permanente Oakland medical center optimizes operating room block schedule for new hospital. Interfaces 47(3):214–229.Link, Google Scholar
• Bertsimas D, Sim M (2004) The price of robustness. Oper. Res. 52(1):35–53.Link, Google Scholar
• Bertsimas D, Weismantel R (2005) Optimization over Integers (Dynamic Ideas, Belmont, MA).Google Scholar
• Centers for Medicare & Medicaid Services (2017) Innovation models. CMS.gov. Accessed November 28, 2017, https://innovation.cms.gov/initiatives/index.html#views=models.Google Scholar
• Coffman EG Jr, Csirik J, Galambos G, Martello S, Vigo D (2013) Bin packing approximation algorithms: Survey and classification. Handbook of Combinatorial Optimization (Springer-Verlag, New York), 455–531.Crossref, Google Scholar
• Denton B, Gupta D (2003) A sequential bounding approach for optimal appointment scheduling. IIE Trans. 35(11):1003–1016.Crossref, Google Scholar
• Denton BT, Miller AJ, Balasubramanian HJ, Huschka TR (2010) Optimal allocation of surgery blocks to operating rooms under uncertainty. Oper. Res. 58(4-Part-1):802–816.Link, Google Scholar
• Dexter F, Macario A, Traub RD (1999a) Which algorithm for scheduling add-on elective cases maximizes operating room utilization? Use of bin packing algorithms and fuzzy constraints in operating room management. Anesthesiology 91(5):1491–1500.Crossref, Google Scholar
• Dexter F, Macario A, Traub R, Hopwood M, Lubarsky D (1999b) An operating room scheduling strategy to maximize the use of operating room block time: Computer simulation of patient scheduling and survey of patients’ preferences for surgical waiting time. Anesthesia Analgesia 89(1):7–20.Google Scholar
• Gerchak Y, Gupta D, Henig M (1996) Reservation planning for elective surgery under uncertain demand for emergency surgery. Management Sci. 42(3):321–334.Link, Google Scholar
• Goldman J, Knappenberger H (1968) How to determine the optimum number of operating rooms. Modern Hospital 111(3):114–116.Google Scholar
• Guerriero F, Guido R (2011) Operational research in the management of the operating theatre: A survey. Health Care Management Sci. 14(1):89–114.Crossref, Google Scholar
• Hopp WJ, Lovejoy WS (2013) Hospital Operations: Principles of High Efficiency Health Care (Pearson Education, Inc., Upper Saddle River, NJ).Google Scholar
• Jackson RL (2002) The business of surgery. Managing the OR as a profit center requires more than just IT. It requires a profit-making mindset, too. Health Management Tech. 23(7):20–22.Google Scholar
• Johnson DS (1973) Near-optimal bin packing algorithms. PhD thesis, Massachusetts Institute of Technology, Cambridge.Google Scholar
• Johnson DS, Demers A, Ullman JD, Garey MR, Graham RL (1974) Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J. Comput. 3(4):299–325.Crossref, Google Scholar
• Kong Q, Lee C, Teo C, Zheng Z (2013) Scheduling arrivals to a stochastic service delivery system using copositive cones. Oper. Res. 61(3):711–726.Link, Google Scholar
• Lee CC, Lee D-T (1985) A simple on-line bin-packing algorithm. J. ACM 32(3):562–572.Crossref, Google Scholar
• Li F, Gupta D, Potthoff S (2016) Improving operating room schedules. Health Care Management Sci. 19(3):261–278.Crossref, Google Scholar
• Lovejoy WS, Li Y (2002) Hospital operating room capacity expansion. Management Sci. 48(11):1369–1387.Link, Google Scholar
• Macario A (2010) What does one minute of operating room cost? J. Clinical Anesthesia 22(4):233–236.Crossref, Google Scholar
• May JH, Spangler WE, Strum DP, Vargas LG (2011) The surgical scheduling problem: Current research and future opportunities. Production Oper. Management 20(3):392–405.Crossref, Google Scholar
• Mittal S, Schulz AS, Stiller S (2014) Robust appointment scheduling. Diaz J, Jansen K, Rolim JDP, Zwick U, eds. Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, Leibniz International Proceedings in Informatics, vol. 28 (Springer, Berlin, Heidelberg), 356–370.Google Scholar
• Nolan JP (1997) Numerical calculation of stable densities and distribution functions. Comm. Statist. Stochastic Models 13(4):759–774.Crossref, Google Scholar
• Seiden SS (2002) On the online bin packing problem. J. ACM 49(5):640–671.Crossref, Google Scholar
• Véricourt Fd, Jennings OB (2011) Nurse staffing in medical units: A queueing perspective. Oper. Res. 59(6):1320–1331.Link, Google Scholar
• Yankovic N, Green LV (2011) Identifying good nursing levels: A queuing approach. Oper. Res. 59(4):942–955.Link, Google Scholar
• Yao AC-C (1980) New algorithms for bin packing. J. ACM 27(2):207–227.Crossref, Google Scholar