Abstract
The surgical scheduling problem that incorporates the surgical duration, the setup time, the turnover time and the due time is studied in this paper. The actual surgical duration is affected by the normal duration, the surgical sequence, the accumulated experience of surgical teams and a controlling parameter. Besides, the surgical duration, the setup time and the turnover time are affected by the deteriorating effect, which means when the start time, the setup time or the turnover time of a surgery is postponed, the actual duration, the actual setup time or the actual turnover time will be prolonged. A schedule problem is formulated to minimize the maximum surgical tardiness. By building and analyzing the surgical scheduling model, each surgical team should operate surgeries according to a non-decreasing order of patients' normal surgical duration. Furthermore, a branch-and-bound algorithm is provided to solve the surgical teams scheduling problem. Our experimental results show the effectiveness and stability of our proposed algorithm.
Highlights
In surgical scheduling, when the actual completion time of a surgery exceeds a given due time, a surgical tardiness occurs and brings harm to the postoperative recovery of the corresponding patient
Similar to Wang et al [18], this paper examined the single day surgical scheduling for single operating room
This paper mainly studied the surgical scheduling problem which incorporates the surgical duration, the setup time, the turnover time and the due time
Summary
In surgical scheduling, when the actual completion time of a surgery exceeds a given due time, a surgical tardiness occurs and brings harm to the postoperative recovery of the corresponding patient. The actual surgical duration decreases with the accumulation of the experience of a surgical team Patients and operating rooms as workers, jobs and machines respectively, the surgical scheduling problem can be formulated as a single machine flow shop scheduling model with variable task durations. In recent years, this type of scheduling problem has been widely studied and provide theoretical basis to our study [10]–[17].
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.
