Find in Library

This paper studies a weekly operation scheduling problem of elective surgery according to the block scheduling policy, to balance overtime (time used beyond the block) and undertime (time unused within the block) of each surgeon's blocks. The one week operation problem is divided into two stages: the first stage is to allocate patients to blocks and achieve the balance of the blocks to the same surgeon. Patients who can be scheduled on next week are determined according to the operating room (OR) capacity, surgeon's available time and patient priority. In the second stage, the operation date, operating room, and operation sequence are determined. When sequencing operations in blocks, we focus on surgical type and priority the two indicators. We present two integer programming (IP) models to solve the two stage problems, with the objects of 1) minimize the sum of all blocks' overtime and undertime penalty and 2) minimize the waiting cost for all patients. The two indicators are helpful to balance surgeons' workload among blocks and can improve patient's satisfaction. Directing at the first stage model, different from the previous studies, we will give a fast method to calculate the number of blocks for each surgeon, which can reduce the problem scale. The computational experiments are conducted illustrating its applicability to the problem in the operating theatre.