Surgical scheduling with simultaneous employment of specialised human resources.

• Autor(a) principal: Silva, Thiago Augusto de Oliveira
• Data de Publicação: 2015
• Outros Autores: Souza, Maurício Cardoso de, Saldanha, Rodney Rezende, Burke, Edmund K.
• Tipo de documento: Artigo
• Idioma: eng
• Título da fonte: Repositório Institucional da UFOP
• Texto Completo: http://www.repositorio.ufop.br/handle/123456789/6810; https://doi.org/10.1016/j.ejor.2015.04.008
• topic: Surgical scheduling; Mathematical modelling; Relax and fix heuristics

Surgical scheduling is a challenging problem faced by hospital managers. It is subject to a wide range of constraints depending upon the particular situation within any given hospital. We deal with the simultaneous employment of specialised human resources, which must be assigned to surgeries according to their skills as well as the time windows of the staff. A particular feature is that they can be assigned to two surgeries simultaneously if the rooms are compatible. The objective is to maximise the use of the operating rooms. We propose an integer model and integer programming based heuristics to address the problem. Computational experiments were conducted on a number of scenarios inspired by real data to cover different practical problem solving situations. Numerical results show that relaxations provide tight upper bounds, and relax-and-fix heuristics are successful in finding optimal or near optimal solutions.