Short-term operating room scheduling: a parallel machine under resource constraints problem Online publication date: Tue, 09-Mar-2021
by Mohamed Amine Abdeljaoued; Zied Bahroun; Nour El Houda Saadani
International Journal of Operational Research (IJOR), Vol. 40, No. 2, 2021
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook