Abstract
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.
Highlights
Medical services in Taiwan are highly accessible with a high coverage of 99% of National Health Insurance
There is a wide spectrum of research articles on operating room scheduling problems
The abstract model considered a variant of server scheduling onaparallel time, and two parts of a and job should be processed consecutively on theWerner same machine, machines, which wastwo first proposed investigated by Kravchenko and i.e., interruptions and migrations to another machine is not permitted
Summary
Medical services in Taiwan are highly accessible with a high coverage of 99% of National Health Insurance. There is a wide spectrum of research articles on operating room scheduling problems. Proposed a hybrid genetic algorithm for minimizing total operating cost that includes the cost for unused idle time and the overtime cost. For the three-stage comprehensive scheduling problem, Belkhamsaa, Jarbouib, and Masmoudi [11] designed an iterative local search and a hybrid genetic algorithm, which are appraised through real workday benchmark instances. The objective function of the first stage include room cost and assistant surgeon cost, and the second stage seeks to minimize personnel waiting time cost and overtime cost. They designed a bound-based algorithm that was test through real data collected from 2706 thoracic surgeries.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
