Solving operating room scheduling problem using artificial bee colony algorithm

Yang Kuei Lin, Min Yang Li

研究成果: Article同行評審

12 引文 斯高帕斯(Scopus)

摘要

Many healthcare institutions are interested in reducing costs and in maintaining a good quality of care. The operating room department is typically one of the most costly units in a hospital. Hospital managers are always interested in finding effective ways of using operating rooms to minimize operating costs. In this research, we study the operating room scheduling problem. We consider the use of a weekly surgery schedule with an open scheduling strategy that takes into account the availabilities of surgeons and operating rooms. The objective is to minimize the total operating cost while maximizing the utilization of the operating rooms but also minimizing overtime use. A revised mathematical model is proposed that can provide optimal solutions for a surgery size up to 110 surgical cases. Next, two modified heuristics, based on the earliest due date (EDD) and longest processing time (LPT) rules, are proposed to quickly find feasible solutions to the studied problem. Finally, an artificial bee colony (ABC) algorithm that incorporates the initial solutions, a recovery scheme, local search schemes, and an elitism strategy is proposed. The computational results show that, for a surgery size between 40 and 100 surgical cases, the ABC algorithm found optimal solutions to all of the tested problems. For surgery sizes larger than 110 surgical cases, the ABC algorithm performed significantly better than the two proposed heuristics. The computational results indicate that the proposed ABC is promising and capable of solving large problems.

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

All Science Journal Classification (ASJC) codes

  • 領導和管理
  • 健康政策
  • 健康資訊學
  • 健康資訊管理

指紋

深入研究「Solving operating room scheduling problem using artificial bee colony algorithm」主題。共同形成了獨特的指紋。

引用此