A Constraint-Programming-Based Branch-and-Price-and-Cut Approach for Operating Room Planning and Scheduling

References

• Atamtürk A (2005) Cover and pack inequalities for (mixed) integer programming. Ann. Oper. Res. 139(1):21–38.Crossref, Google Scholar
• Baligh HH, Laughhunn DJ (1969) An economic and linear model of the hospital. Health Services Res. 4(4):293–303.Google Scholar
• Barnhart C, Hane CA, Vance PH (2000) Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems. Oper. Res. 48(2):318–326.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
• Blake JT, Carter MW (2002) A goal programming approach to strategic resource allocation in acute care hospitals. Eur. J. Oper. Res. 140(3):541–561.Crossref, Google Scholar
• Cardoen B, Demeulemeester E, Beliën J (2009) Sequencing surgical cases in a day-care environment: An exact branch-and-price approach. Comput. Oper. Res. 36(9):2660–2669.Crossref, Google Scholar
• Chu G, Stuckey PJ (2009) Minimizing the maximum number of open stacks by customer search. Gent IP, ed. Principles and Practice of Constraint Programming—CP 2009, Lisbon, Portugal, 242–257.Crossref, Google Scholar
• Chu G, Stuckey PJ (2012) A generic method for identifying and exploiting dominance relations. Milano M, ed. Principles and Practice of Constraint Programming—CP 2012, Lecture Notes in Computer Science, Vol. 7514 (Springer, Berlin), 6–22.Crossref, Google Scholar
• Dantzig GB, Wolfe P (1960) Decomposition principle for linear programs. Oper. Res. 8(1):101–111.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
• De la Banda MG, Stuckey PJ, Chu G (2011) Solving talent scheduling with dynamic programming. INFORMS J. Comput. 23(1):120–137.Link, Google Scholar
• Desaulniers G, Desrosiers J, Solomon MM, eds. (2005) Column Generation (Springer Science & Business Media, New York).Crossref, Google Scholar
• Fahle T, Schamberger S, Sellmann M (2001) Symmetry breaking. Walsh T, ed. Principles and Practice of Constraint Programming—CP 2001, Lecture Notes in Computer Science, Vol. 2239 (Springer, Berlin), 93–107.Crossref, Google Scholar
• Fei H, Chu C, Meskens N (2009) Solving a tactical operating room planning problem by a column-generation-based heuristic procedure with four criteria. Ann. Oper. Res. 166(1):91–108.Crossref, Google Scholar
• Fei H, Meskens N, Chu C (2006) An operating theatre planning and scheduling problem in the case of a block scheduling strategy. Internat. Conf. Service Systems Service Management (IEEE, Piscataway, NJ), 422–428.Crossref, Google Scholar
• Fei H, Meskens N, Chu C (2010) A planning and scheduling problem for an operating theatre using an open scheduling strategy. Comput. Indust. Engrg. 58(2):221–230.Crossref, Google Scholar
• Focacci F, Milano M (2001) Global cut framework for removing symmetries. Walsh T, ed. Principles and Practice of Constraint Programming—CP 2001, Lecture Notes in Computer Science, Vol. 2239 (Springer, Berlin), 77–92.Crossref, Google Scholar
• Gilmore PC, Gomory RE (1961) A linear programming approach to the cutting-stock problem. Oper. Res. 9(6):849–859.Link, Google Scholar
• Gu Z, Nemhauser GL, Savelsbergh MWP (1998) Lifted cover inequalities for 0–1 integer programs: Computation. INFORMS J. Comput. 10(4):427–437.Link, 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
• Guinet A, Chaabane S (2003) Operating theatre planning. Internat. J. Production Econom. 85(1):69–81.Crossref, Google Scholar
• Hashemi Doulabi SH, Rousseau LM, Pesant G (2014) A constraint programming-based column generation approach for operating room planning and scheduling. Simonis H, ed. Integration AI OR Techniques Constraint Programming—CPAIOR, Cork, Ireland, 455–463.Crossref, Google Scholar
• Jebali A, Hadj Alouane AB, Ladet P (2006) Operating rooms scheduling. Internat. J. Production Econom. 99(1):52–62.Crossref, Google Scholar
• Korf RE (2004) Optimal rectangle packing: New results. Internat. Conf. Automated Planning Scheduling (AAAI, Palo Alto, CA), 142–149.Google Scholar
• Leong G, Wilson J, Charlett A (2006) Duration of operation as a risk factor for surgical site infection: Comparison of English and US data. J. Hospital Infection 63(3):255–262.Crossref, Google Scholar
• Marques I, Captivo ME, Pato MV (2012) An integer programming approach to elective surgery scheduling. OR Spectrum 34(2): 407–427.Crossref, Google Scholar
• Prestwich S, Beck JC (2004) Exploiting dominance in three symmetric problems. Fourth Internat. Workshop Symmetry Constraint Satisfaction Problems, Toronto, 63–70. http://zeynep.web.cs.unibo.it/SymCon04/SymCon04.pdf.Google Scholar
• Proll LG, Smith B (1998) Integer linear programming and constraint programming approaches to a template design problem. INFORMS J. Comput. 10(3):265–275.Link, Google Scholar
• Roland B, Di Martinelly C, Riane F (2006) Operating theatre optimization: A resource-constrained based solving approach. Internat. Conf. Service Systems Service Management (IEEE, Piscataway, NJ), 443–448.Crossref, Google Scholar
• Roland B, Di Martinelly C, Riane F, Pochet Y (2010) Scheduling an operating theatre under human resource constraints. Comput. Indust. Engrg. 58(2):212–220.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
• Vijayakumar B, Parikh PJ, Scott R, Barnes A, Gallimore J (2012) A dual bin-packing approach to scheduling surgical cases at a publicly-funded hospital. Eur. J. Oper. Res. 224(3):583–591.Crossref, Google Scholar