Short-term operating room scheduling: a parallel machine under resource constraints problem

Mohamed Amine Abdeljaoued, Zied Bahroun and Nour El Houda Saadani

International Journal of Operational Research, 2021, vol. 40, issue 2, 162-184

Abstract: The paper tackles the daily scheduling of surgical operations in an operating theatre. The considered operating rooms are identical and the set of operations is subdivided into groups, each of them performed by a single surgeon. The objective is to minimise the ending time of the last completed operation (makespan). The problem is NP-hard and is part of the parallel machine scheduling under resource constraints. We provide two mathematical models and compare their performance. The first is based on parallel machines scheduling, while the second highlights the similarities with the strip packing problem. Two heuristics based on a dichotomic approach are then introduced. An experimental study comparing their results to optimal solutions, lower bounds and an existing heuristic from the literature shows that the second proposed method performs the best and provides near-optimal or good results for realistic-size instances in reasonable computational times.

Keywords: scheduling; operating room; parallel machines; strip-packing; resource. (search for similar items in EconPapers)
Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=113501 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:40:y:2021:i:2:p:162-184

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().