Dynamic three-stage operating room scheduling considering patient waiting time and surgical overtime costs

Shuwan Zhu, Wenjuan Fan (), Tongzhu Liu, Shanlin Yang and Panos M. Pardalos
Additional contact information
Shuwan Zhu: Hefei University of Technology
Wenjuan Fan: Hefei University of Technology
Tongzhu Liu: The First Affiliated Hospital of University of Science and Technology of China
Shanlin Yang: Hefei University of Technology
Panos M. Pardalos: University of Florida

Journal of Combinatorial Optimization, 2020, vol. 39, issue 1, No 13, 185-215

Abstract: Abstract In this paper, we study a dynamic operating room scheduling problem which consists of three stages. The problem simultaneously tackles the capacity allocation of operating rooms to each specialty, assignment of operating rooms to surgeons, assignment and sequence of patients. To lower the total costs of operating rooms from both sides of patients and operating rooms, a mathematical model is proposed with objective of minimizing the patient waiting costs and operating room overtime costs. Some structural properties of the studied problem are proposed, and two heuristic algorithms are presented to solve the patient assignment problem based on these structural properties. The studied operating room scheduling problem is proved to be NP-hard, and a hybrid GWO-VNS algorithm combining Grey Wolf Optimizer (GWO) with Variable Neighbourhood Search (VNS) is developed to obtain a good solution, where the heuristic algorithms are incorporated. Finally, computational experiments are conducted to test the efficiency, stability, and convergence speed of the proposed algorithm and compared with other mainstream algorithms. The results show that our proposed algorithm outperforms the compared algorithms.

Keywords: Operating room scheduling; Hybrid algorithm; GWO-VNS; Heuristic (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-019-00463-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:jcomop:v:39:y:2020:i:1:d:10.1007_s10878-019-00463-5

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-019-00463-5

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().