In this paper a 0–1 linear programming model and a solution heuristic algorithm are developed in order to solve the so-called Master Surgical Schedule Problem (MSSP). Given a hospital department made up of different surgical units (i.e. wards) sharing a given number of Operating Rooms (ORs), the problem herein addressed is determining the assignment among wards and ORs during a given planning horizon, together with the subset of patients to be operated on during each day. Different resource constraints related to operating block time length, maximum OR overtime allowable by collective labour agreement and legislation, patient length of stay (LOS), available OR equipment, number of surgeons, number of stay and ICU beds, are considered. Firstly, a 0–1 linear programming model intended to minimise a cost function based upon a priority score, that takes into proper account both the waiting time and the urgency status of each patient, is developed. Successively, an heuristic algorithm that enables us to embody some pre-assignment rules to solve this NP-hard combinatorial optimisation problem, is presented. In particular, we force the assignment of each patient to a subset of days depending on his/her expected length of stay in order to allow closing some stay areas during the weekend and hence reducing overall hospitalisation cost of the department. The results of an extensive computational experimentation aimed at showing the algorithm efficiency in terms of computational time and solution effectiveness are given and analysed.

A pre-assignment heuristic algorithm for the Master Surgical Schedule Problem (MSSP)

TANFANI, ELENA;TESTI, ANGELA
2010

Abstract

In this paper a 0–1 linear programming model and a solution heuristic algorithm are developed in order to solve the so-called Master Surgical Schedule Problem (MSSP). Given a hospital department made up of different surgical units (i.e. wards) sharing a given number of Operating Rooms (ORs), the problem herein addressed is determining the assignment among wards and ORs during a given planning horizon, together with the subset of patients to be operated on during each day. Different resource constraints related to operating block time length, maximum OR overtime allowable by collective labour agreement and legislation, patient length of stay (LOS), available OR equipment, number of surgeons, number of stay and ICU beds, are considered. Firstly, a 0–1 linear programming model intended to minimise a cost function based upon a priority score, that takes into proper account both the waiting time and the urgency status of each patient, is developed. Successively, an heuristic algorithm that enables us to embody some pre-assignment rules to solve this NP-hard combinatorial optimisation problem, is presented. In particular, we force the assignment of each patient to a subset of days depending on his/her expected length of stay in order to allow closing some stay areas during the weekend and hence reducing overall hospitalisation cost of the department. The results of an extensive computational experimentation aimed at showing the algorithm efficiency in terms of computational time and solution effectiveness are given and analysed.
File in questo prodotto:
File Dimensione Formato  
2010_AOR.pdf

accesso chiuso

Tipologia: Documento in versione editoriale
Dimensione 360.21 kB
Formato Adobe PDF
360.21 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11567/223728
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 62
  • ???jsp.display-item.citation.isi??? 51
social impact