Optimal allocation of surgery blocks to operating rooms under uncertainty

Operations Research

Volumn 58, Issue 4 PART 1, 2010, Pages 802-816

  Denton, Brian T ^a   Miller, Andrew J ^b   Balasubramanian, Hari J ^c   Huschka, Todd R ^d  

^a North Carolina State University   (United States)

^b UNIVERSITÉ BORDEAUX 1   (France)

^c University of Massachusetts   (United States)

^d MAYO CLINIC   (United States)

Author keywords

Optimization; Stochastic programming; Surgery

Indexed keywords

BINARY DECISION; COMBINATORIAL OPTIMIZATION PROBLEMS; FIXED COST; HEALTH CARE PROVIDERS; LINEAR PROGRAMS; NUMERICAL EXPERIMENTATIONS; NUMERICAL EXPERIMENTS; OPTIMAL ALLOCATION; OPTIMAL SOLUTIONS; ROBUST METHODS; SIMPLE RECOURSE; SOLUTION METHODOLOGY; STOCHASTIC OPTIMIZATION MODEL; SURGICAL PROCEDURES; TWO STAGE; VARIABLE COSTS;

COMBINATORIAL OPTIMIZATION; COST ACCOUNTING; HEURISTIC METHODS; OPERATING ROOMS; STOCHASTIC PROGRAMMING; STOCHASTIC SYSTEMS; SURGERY;

STOCHASTIC MODELS;

EID: 77955888777     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1090.0791     Document Type: Article

References (39)

1. Atamtürk A. 2007. Strong formulations of robust mixed 0-1 programming. Math. Programming 108(2-3) 235-250.
2. Bailey, N. 1952. A study of queues and appointment systems in hospital outpatient departments, with special reference to waiting-times. J. Roy. Statist. Soc. A14 185-189.
3. Bertsimas, D., M. Sim. 2003. The price of robustness. Oper. Res. 52(1) 35-53.
4. Bertsimas, D., A. Thiele. 2006. A robust optimization approach to inventory theory. Oper. Res. 54(1) 150-168.
5. Bienstock, D., N. Özbay. 2006. Computing robust basestock levels. CORC Report TR-2005-2009, Columbia University, New York.
6. Birge, J. R., F. Louveaux. 1997. Introduction to Stochastic Programming. Springer, New York.
7. Birge, J. R., F. V. Louveaux. 1988. A multicut algorithm for two-stage stochastic linear programs. Eur. J. Oper. Res. 34(3) 384-392.
8. Blake, J. T., J. Donald. 2002. Mount Sinai Hospital uses integer programming to allocate operating room time. Interfaces 32(2) 63-73.
9. Bowers, J., G. Mould. 2005. Ambulatory care and orthopaedic capacity planning. Health Care Management Sci. 8(1) 41-47.
10. CAB. 2001. Surgical services reform: Executive briefing for clinical leaders. Technical report, Clinical Advisory Board, Washington, DC.
11. Charnetski, J. 1984. Scheduling operating room surgical procedure with early and late completion penalty costs. J. Oper. Management 5(1) 91-102.
12. Coffman, E. G., M. R. Garey, D. S. Johnson. 1984. Approximation algorithms for bin packing-An update survey. G. Ausiello, M. Lucertini, P. Serafini, eds. Algorithm Design and Computer System Design. Springer, New York, 49-106.
13. Dell'Olmo, P., H. Kellerer, M. G. Speranza, Z. Tuza. 1998. A 13/12 approximation algorithm for bin packing with extendable bins. Inform. Processing Lett. 65(5) 229-233.
14. Denton, B., J. Viapiano, A. Vogl. 2007. Optimization of surgery sequencing and scheduling decisions under uncertainty. Health Care Management Sci. 10(1) 13-24.
15. Denton, B. T., D. Gupta. 2003. A sequential bounding approach for optimal appointment scheduling. IIE Trans. 35 1003-1016.
16. Dexter, F., R. H. Epstein, A. Macario. 2004. When to release allocated operating room time to increase operating room efficiency. Anesthesia & Analgesia 98(3) 758-762.
17. Dexter, F., A. Macario, R. D. Traub, M. Hopwood, D. A. Lubarsky. 1999. An operating room scheduling strategy to maximize the use of operating room block time: Computer simulation of patient scheduling and survey of patient preferences for surgical waiting time. Anesthesia & Analgesia 89 7-20.
18. Goldman, J., H. A. Knappenberger, W. J. Shearson. 1970. A study of the variability of surgical estimates. Hospital Management 110(3) 46-46D.
19. HFMA. 2005. Achieving operating room efficiency through process integration. Technical report, Health Care Financial Management Association, Westchester
20. IL. Ho, C.-J., H.-S. Lau. 1992. Minimizing total cost in scheduling outpatient appointments. Management Sci. 38(12) 750-764.
21. Jansson, B. 1966. Choosing a good appointment system-A study of queues of the type (D,M,1). Oper. Res. 14(2) 292-312.
22. Kall, P., S. W. Wallace. 1994. Stochastic Programming. John Wiley and Sons, New York.
23. Magerlein, J. M., J. B. Martin. 1978. Surgical demand scheduling: A review. Health Services Res. 13(4) 418-433.
24. Marchand, H., L. A. Wolsey. 1999. The 0-1 knapsack problem with a single continuous variable. Math. Programming 85(1) 15-33.
25. Marchand, H., L. A. Wolsey. 2001. Aggregation and mixed integer rounding to solve MIPs. Oper. Res. 49(3) 363-371.
26. Margot, F. 2003. Exploiting orbits in symmetric ILP. Math. Programming 98(1) 3-21.
27. McIntosh, C., F. Dexter, R. H. Epstein. 2006. Impact of service-specific staffing, case scheduling, turnovers, and first-case starts on anesthesia group and operating room productivity: A tutorial using data from an Australian hospital. Anesthesia & Analgesia 103(6) 1499-1516.
28. Mercer, A. 1973. Queues with scheduled arrivals: A correction simplification and extension. J. Royal Statist. Soc. Series 5(35) 104-116.
29. Ostrowski, J., J. Linderoth, F. Rossi, S. Smriglio. 2009. Orbital branching. Math. Programming Ser. A, ePub ahead of print March 10.
30. Przasnyski, Z. 1986. Operating room scheduling: A literature review. AORN J. 44(1) 67-79.
31. Richard, J. P. P., I. R. de Farias Jr., G. L. Nemhauser. 2003. Lifted inequalities for 0-1 mixed-integer programming: Basic theory and algorithms. Math. Programming 98(1-3) 89-113.
32. Rohleder, T. R., K. J. Klassen. 2002. Rolling horizon appointment scheduling: A simulation study. Health Care Management Sci. 5(3) 201-209.
33. Sabria, F., C. F. Daganzo. 1989. Approximate expressions for queuing systems with scheduling arrivals and established service order. Transportation Sci. 23(3) 159-165.
34. Sherali, H. D., J. C. Smith. 2001. Improving discrete model representations via symmetry considerations. Management Sci. 47(10) 1396-1407.
35. Soriano, A. 1966. Comparison of two scheduling systems. Oper. Res. 14(3) 388-397.
36. Vanden Bosch, P. M., D. C. Dietz. 2000. Minimizing expected waiting time in a medical appointment system. IIE Trans. 32(9) 841-848.
37. Wang, P. P. 1993. Static and dynamic scheduling of customer arrivals to a single-server system. Naval Res. Logist. 40(3) 345-360.
38. Weiss, E. N. 1990. Models for determining the estimated start times and case orderings. IIE Trans. 22(2) 143-150.
39. Welch, J. 1964. Appointment systems in hospital outpatient departments. Oper. Res. Quart. 15(3) 224-237.