University of Twente Student Theses

Login

Minimizing the overlap of cleaning times after surgeries while considering multiple cleaning teams.

Middelkamp, T.P. (2020) Minimizing the overlap of cleaning times after surgeries while considering multiple cleaning teams.

[img] PDF
542kB
Abstract:Scheduling surgeries in their preassigned Operating Room (OR) is an important task of any hospital. This paper investigates the issue of determining the order in which surgeries are being scheduled in each OR in order to minimize the cleaning time overlap after surgeries. In this way, the delay caused by a lack of cleaning teams is minimized and utilities are more efficiently used. An Integer Linear Program (ILP) is given for small instances. Several heuristic methods are introduced that are tested in a simulation study. For the simulation, real data from a Dutch hospital is used. Several realistic constraints are taken into account in the simulation. Different types of surgeries and subcategories of these surgeries are determined from the data. To test the heuristics we simulate several weeks that are reproduced from the data. The results show that the ’Prevent overlap’ heuristic with four cleaning teams can reduce the average sum of the cleaning time overlap with more than 10% when compared to the original schedule.
Item Type:Essay (Bachelor)
Faculty:EEMCS: Electrical Engineering, Mathematics and Computer Science
Subject:31 mathematics
Programme:Applied Mathematics BSc (56965)
Link to this item:http://purl.utwente.nl/essays/81971
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page