IDEAS home Printed from https://ideas.repec.org/a/ids/eujine/v2y2008i2p172-189.html
   My bibliography  Save this article

Operating theatre scheduling using Lagrangian relaxation

Author

Listed:
  • V. Augusto
  • X. Xie
  • V. Perdomo

Abstract

This paper addresses the surgery operation scheduling problem. Three types of resources are considered: transporters, operating rooms and recovery beds. The patient is first transported from the ward to the operating theatre, is operated on in an operating room and then transferred immediately to a recovery bed before being transported back to the ward. The operating room needs to be cleaned after the surgery before starting another operation. The problem consists in assigning patients to transporters, operating rooms and recovery beds in order to minimise a criterion function of their completion times. The problem is NP-hard. A Lagrangian relaxation approach is proposed to determine a near-optimal schedule and a tight lower bound. Numerical results will be presented to show the efficiency of the method. [Received 31 January 2007; Revised 01 August 2007; Accepted 14 October 2007]

Suggested Citation

  • V. Augusto & X. Xie & V. Perdomo, 2008. "Operating theatre scheduling using Lagrangian relaxation," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 2(2), pages 172-189.
    • Handle: RePEc:ids:eujine:v:2:y:2008:i:2:p:172-189
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=17350
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Şeyda Gür & Tamer Eren & Hacı Mehmet Alakaş, 2019. "Surgical Operation Scheduling with Goal Programming and Constraint Programming: A Case Study," Mathematics, MDPI, vol. 7(3), pages 1-24, March.
    2. 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.
    3. Bernardetta Addis & Giuliana Carello & Andrea Grosso & Elena Tànfani, 2016. "Operating room scheduling and rescheduling: a rolling horizon approach," Flexible Services and Manufacturing Journal, Springer, vol. 28(1), pages 206-232, June.
    4. 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.
    5. 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.
    6. Silva, Thiago A.O. & de Souza, Mauricio C. & Saldanha, Rodney R. & Burke, Edmund K., 2015. "Surgical scheduling with simultaneous employment of specialised human resources," European Journal of Operational Research, Elsevier, vol. 245(3), pages 719-730.
    7. Francesca Guerriero & Rosita Guido, 2011. "Operational research in the management of the operating theatre: a survey," Health Care Management Science, Springer, vol. 14(1), pages 89-114, March.

    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:ids:eujine:v:2:y:2008:i:2:p:172-189. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=210 .

    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.