Scheduling of anaesthesia operations in operating rooms

Pi Yu Hsu*, Shao Hua Lo, Hsin Gin Hwang, Bertrand M.T. Lin

*此作品的通信作者

研究成果: Article同行評審

4 引文 斯高帕斯(Scopus)

摘要

This paper considers scheduling of surgical operations across multiple operating rooms subject to the limited availability of anaesthetists. The objective is to construct a feasible operations schedule that has the minimum makespan, i.e., the completion time of all operations. We abstract the problem into a theoretical server scheduling problem and formulate it in a mathematical form by proposing an integer programming model. Due to the intractability of its computing time, we circumvent the exact approaches and develop two approximation methods. Then, the steepest descent search is adopted for improving the solutions. Computational study suggests that the proposed methods can produce quality solutions in a few seconds.

原文English
文章編號640
期刊Healthcare (Switzerland)
9
發行號6
DOIs
出版狀態Published - 6月 2021

指紋

深入研究「Scheduling of anaesthesia operations in operating rooms」主題。共同形成了獨特的指紋。

引用此