1. Limited-time decision making with Tabu search for an operating theatre daily scheduling problem
- Author
-
Louvain School of Management - Accounting & Finance, Hanset, Arnaud, Meskens, Nadine, Duvivier, David, Roux, Olivier, Fei, Hongying, ORAHS, Louvain School of Management - Accounting & Finance, Hanset, Arnaud, Meskens, Nadine, Duvivier, David, Roux, Olivier, Fei, Hongying, and ORAHS
- Abstract
In this research, we are interested in the daily scheduling problem with a strategy named "open scheduling strategy". Considering this strategy all operating rooms are available for all possible surgical cases and their time blocks are not reserved for specific surgeons, i.e., once a set of surgical cases are assigned to one day one or several weeks in advance, we schedule these surgical cases into a set of multifunctional operating rooms so as to fulfill the restrictions of the recovery room and surgeons and aim at minimizing the daily operating cost of the operating theatre. Consequently, the objective is to minimize the weighted sum of occupation time of the recovery room and that of operating rooms. In addition, if there exist several daily operating programs with the same objective value, an auxiliary criterion, the weighed sum of occupation time of the recovery room and the average occupation time of operating rooms, is applied in order to find the final solution In this research
- Published
- 2007