Economics at your fingertips  

A Multi-objective Hospital Operating Room Planning and Scheduling Problem Using Compromise Programming

Christine Di Martinelly, G. Yazgi Tütüncü, Joaquin Aguado and Alejandra Duenas ()

Post-Print from HAL

Abstract: This paper proposes a hybrid compromise programming local search approach with two main characteristics: a capacity to generate non-dominated solutions and the ability to interact with the decision maker. Compromise programming is an approach where it is not necessary to determine the entire set of Pareto-optimal solutions but only some of them. These solutions are called compromise solutions and represent a good tradeoff between conflicting objectives. Another advantage of this type of method is that it allows the inclusion of the decision maker's preferences through the definition of weights included in the different metrics used by the method. This approach is tested on an operating room planning process. This process incorporates the operating rooms and the nurse planning simultaneously. Three different objectives were considered: to minimize operating room costs, to minimize the maximum number of nurses needed to participate in surgeries and to minimize the number of open operating rooms. The results show that it is a powerful decision tool that enables the decision makers to apply compromise alongside optimal solutions during an operating room planning process.

Date: 2017-08-03
Note: View the original document on HAL open archive server:
References: Add references at CitEc
Citations: Track citations by RSS feed

Published in Grigori Sidorov (éd.); Oscar Herrera-Alcántara (éd.). Advances in Computational Intelligence, Springer, pp.379-390, 2017, ⟨10.1007/978-3-319-62434-1_31⟩

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:

DOI: 10.1007/978-3-319-62434-1_31

Access Statistics for this paper

More papers in Post-Print from HAL
Bibliographic data for series maintained by CCSD ().

Page updated 2022-09-15
Handle: RePEc:hal:journl:hal-03272706