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

Elena Tànfani () and Angela Testi ()

Annals of Operations Research, 2010, vol. 178, issue 1, 105-119

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. Copyright Springer Science+Business Media, LLC 2010

Keywords: Operating room planning; 0–1 linear programming model; Heuristic algorithm; Computational results (search for similar items in EconPapers)
Date: 2010
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (21)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-009-0568-6 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:178:y:2010:i:1:p:105-119:10.1007/s10479-009-0568-6

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-009-0568-6

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().