IDEAS home Printed from https://ideas.repec.org/a/inm/ormsom/v14y2012i4p567-583.html
   My bibliography  Save this article

Integrated Block Sharing: A Win-Win Strategy for Hospitals and Surgeons

Author

Listed:
  • Robert Day

    (Operations and Information Management, School of Business, University of Connecticut, Storrs, Connecticut 06269)

  • Robert Garfinkel

    (Operations and Information Management, School of Business, University of Connecticut, Storrs, Connecticut 06269)

  • Steven Thompson

    (Management Department, Robins School of Business, University of Richmond, Richmond, Virginia 23173)

Abstract

We consider the problem of balancing two competing objectives in the pursuit of efficient management of operating rooms in a hospital: providing surgeons with predictable, reliable access to the operating room and maintaining high utilization of capacity. The common solution to the first problem (in practice) is to grant exclusive "block time," in which a portion of the week in an operating room is designated to a particular surgeon, barring other surgeons from using this room/time. As a major improvement over this existing approach, we model the possibility of "shared" block time, which need only satisfy capacity constraints in expectation. We reduce the computational difficulty of the resulting NP-hard block-scheduling problem by implementing a column-generation approach and demonstrate the efficacy of this technique using simulation, calibrated to a real hospital's historical data and objectives.Our simulations illustrate substantial benefits to hospitals under a variety of circumstances and demonstrate the advantages of our new approach relative to a benchmark method taken from the recent literature.

Suggested Citation

  • Robert Day & Robert Garfinkel & Steven Thompson, 2012. "Integrated Block Sharing: A Win-Win Strategy for Hospitals and Surgeons," Manufacturing & Service Operations Management, INFORMS, vol. 14(4), pages 567-583, October.
  • Handle: RePEc:inm:ormsom:v:14:y:2012:i:4:p:567-583
    DOI: 10.1287/msom.1110.0372
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/msom.1110.0372
    Download Restriction: no

    File URL: https://libkey.io/10.1287/msom.1110.0372?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Michael Samudra & Carla Van Riet & Erik Demeulemeester & Brecht Cardoen & Nancy Vansteenkiste & Frank E. Rademakers, 2016. "Scheduling operating rooms: achievements, challenges and pitfalls," Journal of Scheduling, Springer, vol. 19(5), pages 493-525, October.
    2. Sepehr Nemati & Oleg V. Shylo & Oleg A. Prokopyev & Andrew J. Schaefer, 2016. "The Surgical Patient Routing Problem: A Central Planner Approach," INFORMS Journal on Computing, INFORMS, vol. 28(4), pages 657-673, November.
    3. Seokjun Youn & H. Neil Geismar & Michael Pinedo, 2022. "Planning and scheduling in healthcare for better care coordination: Current understanding, trending topics, and future opportunities," Production and Operations Management, Production and Operations Management Society, vol. 31(12), pages 4407-4423, December.
    4. Vahid Roshanaei & Curtiss Luong & Dionne M. Aleman & David R. Urbach, 2017. "Collaborative Operating Room Planning and Scheduling," INFORMS Journal on Computing, INFORMS, vol. 29(3), pages 558-580, August.
    5. Shuwan Zhu & Wenjuan Fan & Shanlin Yang & Jun Pei & Panos M. Pardalos, 2019. "Operating room planning and surgical case scheduling: a review of literature," Journal of Combinatorial Optimization, Springer, vol. 37(3), pages 757-805, April.
    6. Zhang, Yu & Wang, Yu & Tang, Jiafu & Lim, Andrew, 2020. "Mitigating overtime risk in tactical surgical scheduling," Omega, Elsevier, vol. 93(C).
    7. Sun, Yanshuo & Chen, Zhi-Long & Zhang, Lei, 2020. "Nonprofit peer-to-peer ridesharing optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
    8. Miao Bai & Bjorn Berg & Esra Sisikoglu Sir & Mustafa Y. Sir, 2023. "Partially partitioned templating strategies for outpatient specialty practices," Production and Operations Management, Production and Operations Management Society, vol. 32(1), pages 301-318, January.
    9. Roshanaei, Vahid & Luong, Curtiss & Aleman, Dionne M. & Urbach, David, 2017. "Propagating logic-based Benders’ decomposition approaches for distributed operating room scheduling," European Journal of Operational Research, Elsevier, vol. 257(2), pages 439-455.
    10. Daniel Montanera & Abhay Nath Mishra & T. S. Raghu, 2022. "Mitigating Risk Selection in Healthcare Entitlement Programs: A Beneficiary-Level Competitive Bidding Approach," Information Systems Research, INFORMS, vol. 33(4), pages 1221-1247, December.
    11. Seyed Hossein Hashemi Doulabi & Louis-Martin Rousseau & Gilles Pesant, 2016. "A Constraint-Programming-Based Branch-and-Price-and-Cut Approach for Operating Room Planning and Scheduling," INFORMS Journal on Computing, INFORMS, vol. 28(3), pages 432-448, August.
    12. Koppka, Lisa & Wiesche, Lara & Schacht, Matthias & Werners, Brigitte, 2018. "Optimal distribution of operating hours over operating rooms using probabilities," European Journal of Operational Research, Elsevier, vol. 267(3), pages 1156-1171.
    13. Babak Akbarzadeh & Ghasem Moslehi & Mohammad Reisi-Nafchi & Broos Maenhout, 2020. "A diving heuristic for planning and scheduling surgical cases in the operating room department with nurse re-rostering," Journal of Scheduling, Springer, vol. 23(2), pages 265-288, April.
    14. Pinar Keskinocak & Nicos Savva, 2020. "A Review of the Healthcare-Management (Modeling) Literature Published in Manufacturing & Service Operations Management," Manufacturing & Service Operations Management, INFORMS, vol. 22(1), pages 59-72, January.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormsom:v:14:y:2012:i:4:p:567-583. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.