Optimizing a multiple objective surgical case sequencing problem

Brecht Cardoen, Erik Demeulemeester and Jeroen Beliën

International Journal of Production Economics, 2009, vol. 119, issue 2, 354-366

Abstract: This paper studies a multi-objective combinatorial optimization problem in which the sequence of patients within the operating rooms of a freestanding ambulatory surgical center has to be determined. We show that the optimization problem is NP-hard and we develop some mixed integer linear programming solution approaches, which are either exact or heuristic in nature, to facilitate the decision process of the operating room scheduler. We gathered data from the UZ Leuven Campus Gasthuisberg (Belgium) to develop a structured but artificial test set and introduced the 224 instances to evaluate and compare the computational performance of the algorithmic approaches. Since the focus of this paper is directed towards the development and the computational testing of the solution procedures, we only briefly document on some case study results with real data.

Keywords: Health; care; Operating; room; scheduling; Mixed; integer; linear; programming (search for similar items in EconPapers)
Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (13)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0925-5273(09)00088-7
Full text for ScienceDirect subscribers only

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:eee:proeco:v:119:y:2009:i:2:p:354-366

Access Statistics for this article

International Journal of Production Economics is currently edited by Stefan Minner

More articles in International Journal of Production Economics from Elsevier
Bibliographic data for series maintained by Catherine Liu ().