.png){kind=icon}
.png){kind=icon}
Return
Maximizing the Total Weighted Operating Time for Surgery Scheduling via Linear Program Randomized Rounding Algorithms
.png){kind=icon}
PRE
AI
DOI：10.6688/jise.202605_42(3).0004.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A surgery scheduling problem has been characterized by the integer linear program in the previous work. The objective function is to maximize the total weighted operating time of the week, which equivalently minimizes the idle time on the operating rooms (ORs). The constraints ensure that each operation can only be scheduled once and guarantee that the total time spent on all operations for all departments does not exceed the working hour of a day. We propose two randomized linear program rounding algorithms to solve the problem approximately and in this paper finally show their performances in terms of approximation ratios with a bounded probability for infeasibility and with a feasibility guarantee, respectively. We also supplement the analytical result with numericlal result from experiments.
Keywords:
surgery scheduling
integer linear programming
linear program randomized rounding
total weighted operating time
concentration bounds
Journal
J
IF:
1.1
Papers:
43
Citations:
0