IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-540-32539-0_67.html
   My bibliography  Save this book chapter

A Set Packing Approach for Scheduling Elective Surgical Procedures

In: Operations Research Proceedings 2005

Author

Listed:
  • R. Velásquez

    (Fraunhofer Institute for Industrial Mathematics (ITWM))

  • M. T. Melo

    (Fraunhofer Institute for Industrial Mathematics (ITWM))

Abstract

Summary The efficient scheduling of surgical procedures to operating rooms in a hospital is a complex problem due to limited resources (e.g. medical staff, equipment) and conflicting objectives (e.g. reduce running costs and increase staff and patient satisfaction). A novel approach for scheduling elective surgeries over a short-term horizon is proposed which takes explicit consideration of these aspects. The problem is formulated as a set packing problem and solved optimally through column generation and constraint branching. Good results were obtained for instances from the literature.

Suggested Citation

  • R. Velásquez & M. T. Melo, 2006. "A Set Packing Approach for Scheduling Elective Surgical Procedures," Operations Research Proceedings, in: Hans-Dietrich Haasis & Herbert Kopfer & Jörn Schönberger (ed.), Operations Research Proceedings 2005, pages 425-430, Springer.
    • Handle: RePEc:spr:oprchp:978-3-540-32539-0_67
    DOI: 10.1007/3-540-32539-5_67
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

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


    Cited by:

    1. Nguyen, Tri-Dung, 2014. "A fast approximation algorithm for solving the complete set packing problem," European Journal of Operational Research, Elsevier, vol. 237(1), pages 62-70.
    2. Cardoen, Brecht & Demeulemeester, Erik & Beliën, Jeroen, 2010. "Operating room planning and scheduling: A literature review," European Journal of Operational Research, Elsevier, vol. 201(3), pages 921-932, March.
    3. 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.

    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:spr:oprchp:978-3-540-32539-0_67. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.