The Surgical Patient Routing Problem: A Central Planner Approach

References

• Barnhart C, Johnson EL, Nemhauser GL, Savelsbergh MWP, Vance PH (1998) Branch-and-price: Column generation for solving huge integer programs. Oper. Res. 46(3):316–329.Link, 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
• Begur SV, Miller DM, Weaver JR (1997) An integrated spatial DSS for scheduling and routing home-health-care nurses. Interfaces 27(4):35–48.Link, Google Scholar
• Bigras LP, Gamache M, Savard G (2008) The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times. Discrete Optim. 5(4):685–699.Crossref, Google Scholar
• Blake JT, Carter MW (1997) Surgical process scheduling: A structured review. J. Soc. Health Systems 5(3):17–30.Google Scholar
• Blake JT, Donald J (2002) Mount Sinai Hospital uses integer programming to allocate operating room time. Interfaces 32(2):63–73.Link, Google Scholar
• Burkhardt JE, Garrity R (2012) Sharing the costs of human services transportation. Transportation research record. J. Transportation Res. Board 2277(1):57–64.Crossref, Google Scholar
• Burkhardt JE, Rubino JM, Yum J (2011) TCRP Research Results Digest 99: Improving Mobility for Veterans (Transportation Research Board, National Academies, Washington, DC).Crossref, Google Scholar
• Cardoen B, Demeulemeester E, Beliën J (2010) Operating room planning and scheduling: A literature review. Eur. J. Oper. Res. 201(3):921–932.Crossref, Google Scholar
• Chen Z-L (2010) Integrated production and outbound distribution scheduling: Review and extensions. Oper. Res. 58(1):130–148.Link, Google Scholar
• Day R, Garfinkel R, Thompson S (2012) Integrated block sharing: A win–win strategy for hospitals and surgeons. Manufacturing Service Oper. Management 14(4):567–583.Link, Google Scholar
• Denton BT (2009) Practice abstracts. Interfaces 39(6):549–551.Link, Google Scholar
• Department of Veterans Affairs (2013) The Veteran Population Model (VetPop2007). Accessed June 2013, http://www.va.gov/vetdata.Google Scholar
• Desaulniers G (2010) Branch-and-price-and-cut for split-delivery vehicle routing problem with time windows. Oper. Res. 58(1):179–192.Link, Google Scholar
• Dexter F (2016) Bibliography of operating room management articles. Accessed February 2016, http://www.FranklinDexter.net/bibliography_TOC.htm.Google Scholar
• Dexter F, Traub RD, Macario A (2003) How to release allocated operating room time to increase efficiency: Predicting which surgical service will have the most underutilized operating room time. Anesthesia Analgesia 96(2):507–512.Crossref, Google Scholar
• Dexter F, Macario A, Traub RD, Hopwood M, Lubarsky DA (1999) 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
• Dumas Y, Desrosiers J, Soumis F (1991) The pickup and delivery problem with time windows. Eur. J. Oper. Res. 54(1):7–22.Crossref, Google Scholar
• Erdogan SA, Denton BT (2011) Surgery planning and scheduling. Cochran JJ, Cox LA, Keskinocak P, Kharoufeh JP, Smith JC, eds. Wiley Encyclopedia of Operations Research and Management Science (John Wiley & Sons, New York).Crossref, Google Scholar
• Fischetti M, Laporte G, Martello S (1993) The delivery man problem and cumulative matroids. Oper. Res. 41(6):1055–1064.Link, Google Scholar
• Fitzpatrick AL, Powe NR, Cooper LS, Ives DG, Robbins JA (2004) Barriers to health care access among the elderly and who perceives them. Amer. J. Public Health 94(10):1789–1794.Crossref, Google Scholar
• Fox KR, Gavish B, Graves SC (1980) An n-constraint formulation of the (time-dependent) traveling salesman problem. Oper. Res. 28(4):1018–1021.Link, Google Scholar
• Gupta D (2007) Surgical suites’ operations management. Production Oper. Management 16(6):689–700.Crossref, Google Scholar
• Gupta D, Denton BT (2008) Appointment scheduling in health care: Challenges and opportunities. IIE Trans. 40(9):800–819.Crossref, Google Scholar
• Hans E, Wullink G, van Houdenhoven M, Kazemier G (2008) Robust surgery loading. Eur. J. Oper. Res. 185(3):1038–1050.Crossref, Google Scholar
• Heilporn G, Cordeau JF, Laporte G (2010) The delivery man problem with time windows. Discrete Optim. 7(4):269–282.Crossref, Google Scholar
• Keha AB, Khowala K, Fowler JW (2009) Mixed integer programming formulations for single machine scheduling problems. Comput. Indust. Engrg. 56(1):357–367.Crossref, Google Scholar
• Laporte G (1992) The vehicle routing problem: An overview of exact and approximate algorithms. Eur. J. Oper. Res. 59(3):345–358.Crossref, Google Scholar
• Lucena A (1990) Time-dependent traveling salesman problem—the deliveryman case. Networks 20(6):753–763.Crossref, Google Scholar
• Mehrotra A, Johnson EL, Nemhauser GL (1998) An optimization based heuristic for political districting. Management Sci. 44(8):1100–1114.Link, Google Scholar
• Miller CE, Tucker AW, Zemlin RA (1960) Integer programming formulation of traveling salesman problems. J. ACM 7(4):326–329.Crossref, Google Scholar
• Min D, Yih Y (2010) Scheduling elective surgery under uncertainty and downstream capacity constraints. Eur. J. Oper. Res. 206(3):642–652.Crossref, Google Scholar
• Ngueveu SU, Prins C, Wolfler-Calvo R (2010) An efficient memetic algorithm for the cumulative capacitated vehicle routing problem. Comput. Oper. Res. 37(11):1877–1885.Crossref, Google Scholar
• Okoro CA, Strine TW, Young SL, Balluz LS, Mokdad AH (2005) Access to health care among older adults and receipt of preventive services. Results from the behavioral risk factor surveillance system, 2002. Preventive Medicine 40(3):337–343.Crossref, Google Scholar
• Park J, Kim B (2010) The school bus routing problem: A review. Eur. J. Oper. Res. 202(2):311–319.Crossref, Google Scholar
• Picard J-C, Queyranne M (1978) The time-dependent traveling salesman problem and its application to the tardiness problem in one-machine scheduling. Oper. Res. 26(1):86–110.Link, Google Scholar
• Queyranne M, Schulz AS (1994) Polyhedral approaches to machine scheduling. Technical Report 408, Department of Mathematics, Technical University of Berlin.Google Scholar
• Ralphs TK, Ladanyi L (2003) COIN-OR: Software tools for implementing custom solvers. Accessed June 2012, http://www.coin-or.org/Presentations/INFORMSWorkshop03.pdf.Google Scholar
• Rask KJ, Williams MV, Parker RM, McNagny SE (1994) Obstacles predicting lack of a regular provider and delays in seeking care for patients at an urban public hospital. J. Amer. Medical Assoc. 271(24):1931–1933.Crossref, Google Scholar
• Ribeiro CC, Soumis F (1994) A column generation approach to the multiple-depot vehicle scheduling problem. Oper. Res. 42(1):41–52.Link, Google Scholar
• Ribeiro GM, Laporte G (2012) An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem. Comput. Oper. Res. 39(3):728–735.Crossref, Google Scholar
• Ryan DM, Foster BA (1981) An integer programming approach to scheduling. Wren A, ed. Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling (North-Holland, Amsterdam), 269–280.Google Scholar
• Sarmiento A, Nagi R (1999) A review of integrated analysis of production-distribution systems. IIE Trans. 31(11):1061–1074.Crossref, Google Scholar
• Shylo OV, Prokopyev OA, Schaefer AJ (2013) Stochastic operating room scheduling for high-volume specialties under block booking. INFORMS J. Comput. 25(4):682–692.Link, Google Scholar
• Sol M (1994) Column generation techniques for pickup and delivery problems. Unpublished doctoral dissertation, Eindhoven University of Technology, Netherlands.Google Scholar
• Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2):254–265.Link, Google Scholar
• Toth P, Vigo D (2002) The Vehicle Routing Problem (Society for Industrial and Applied Mathematics, Philadelphia).Crossref, Google Scholar
• Trautsamwieser A, Hirsch P (2014) A branch-price-and-cut approach for solving the medium-term home health care planning problem. Networks 64(3):143–159.Crossref, Google Scholar
• van Oostrum JM, Parlevliet T, Wagelmans APM, Kazemier G (2009) Method for clustering surgical cases to allow master surgical scheduling. INFOR 49(4):254–260.Google Scholar