Surgical scheduling with simultaneous employment of specialised human resources.

Submitted by Ana Caroline Calderaro (karolcalderaro@hotmail.com) on 2016-08-09T13:22:14Z No. of bitstreams: 1 ARTIGO_SurgicalSchedulingSimultaneos.pdf: 647574 bytes, checksum: 8fd5582465ab22b2f4e3e854d2462f79 (MD5)Approved for entry into archive by Oliveira Flávia (flavia@sisbin.ufop.br) on 2016-08-09T15:37:19Z (GMT) No. of bitstreams: 1 ARTIGO_SurgicalSchedulingSimultaneos.pdf: 647574 bytes, checksum: 8fd5582465ab22b2f4e3e854d2462f79 (MD5)Made available in DSpace on 2016-08-10T18:28:47Z (GMT). No. of bitstreams: 1 ARTIGO_SurgicalSchedulingSimultaneos.pdf: 647574 bytes, checksum: 8fd5582465ab22b2f4e3e854d2462f79 (MD5) Previous issue date: 2015Surgical 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