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

被引:1
作者
Duenas, Alejandra [1 ]
Di Martinelly, Christine [1 ]
Tutuncu, G. Yazgi [1 ,2 ]
Aguado, Joaquin [3 ]
机构
[1] LEM CNRS, IESEG, Sch Management, 3 Rue Digue, F-59000 Lille, France
[2] Izmir Univ Econ, Dept Math, Sakarya Cad 156 Balcova, Izmir, Turkey
[3] Univ Bamberg, Bamberg, Germany
来源
ADVANCES IN COMPUTATIONAL INTELLIGENCE, MICAI 2016, PT I | 2017年 / 10061卷
关键词
Multi-objective optimization; Compromise programming; Mixed integer programming; Local search; Operating room scheduling; CRITERIA; SURGERY; ALGORITHM; THEATER; DEMAND;
D O I
10.1007/978-3-319-62434-1_31
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页码:379 / 390
页数:12
相关论文
共 50 条
[31]   A multi-objective discrete invasive weed optimization for multi-objective blocking flow-shop scheduling problem [J].
Shao, Zhongshi ;
Pi, Dechang ;
Shao, Weishi .
EXPERT SYSTEMS WITH APPLICATIONS, 2018, 113 :77-99
[32]   A multi-objective tabu search algorithm based on decomposition for multi-objective unconstrained binary quadratic programming problem [J].
Zhou, Ying ;
Wang, Jiahai ;
Wu, Ziyan ;
Wu, Keke .
KNOWLEDGE-BASED SYSTEMS, 2018, 141 :18-30
[33]   Multi-objective Fuzzy Geometric Programming Problem Using Fuzzy Geometry [J].
Chakraborty, Debjani ;
Chatterjee, Abhijit ;
Aishwaryaprajna .
TRENDS IN MATHEMATICS AND COMPUTATIONAL INTELLIGENCE, 2019, 796 :123-129
[34]   A Neutrosophic Compromise Programming Technique to Solve Multi-Objective Assignment Problem with T2TpFNs [J].
Kamal M. ;
Kaur P. ;
Ali I. ;
Ahmed A. .
Neutrosophic Sets and Systems, 2022, 51 :172-204
[35]   Using Multi-objective Metaheuristics to Solve the Software Project Scheduling Problem [J].
Chicano, Francisco ;
Luna, Francisco ;
Nebro, Antonio J. ;
Alba, Enrique .
GECCO-2011: PROCEEDINGS OF THE 13TH ANNUAL GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2011, :1915-1922
[36]   Multi-objective programming of pumped-hydro-thermal scheduling problem using normal boundary intersection and VIKOR [J].
Simab, Mohsen ;
Javadi, Mohammad Sadegh ;
Nezhad, Ali Esmaeel .
ENERGY, 2018, 143 :854-866
[37]   A Priority Based Optimization Algorithm for Multi-objective Integrated Process Planning and Scheduling Problem [J].
Ausaf, Muhammad Farhan ;
Li, Xinyu ;
Liang, Gao .
2014 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM), 2014, :1327-1331
[38]   A stochastic approach for solving the operating room scheduling problem [J].
Molina-Pariente, Jose M. ;
Hans, Erwin W. ;
Framinan, Jose M. .
FLEXIBLE SERVICES AND MANUFACTURING JOURNAL, 2018, 30 (1-2) :224-251
[39]   Multi-Objective Planning for Conjunctive Use of Surface and Ground Water Resources Using Genetic Programming [J].
Reza Sepahvand ;
Hamid R. Safavi ;
Farshad Rezaei .
Water Resources Management, 2019, 33 :2123-2137
[40]   Ensemble of multi-objective metaheuristic algorithms for multi-objective unconstrained binary quadratic programming problem [J].
Zhou, Ying ;
Kong, Lingjing ;
Wu, Ziyan ;
Liu, Shaopeng ;
Cai, Yiqiao ;
Liu, Ye .
APPLIED SOFT COMPUTING, 2019, 81