Stochastic operating room scheduling: a new model for solving problem and an approach for determining the factors that affect operation time variations

被引:3
作者
Gur, Seyda [1 ]
Alakas, Haci Mehmet [2 ]
Pinarbasi, Mehmet [2 ]
Eren, Tamer [2 ]
机构
[1] Harran Univ, Organized Ind Zone Vocat Sch, Sanliurfa, Turkiye
[2] Kırıkkale Univ, Fac Engn & Nat Sci, Dept Ind Engn, Kirikkale, Turkiye
关键词
Operating room scheduling; Chance constraint programming; ANP; PROMETHEE; ELECTIVE SURGERY; OPTIMIZATION; ALGORITHM; CANCELLATION; SELECTION; BEDS;
D O I
10.1007/s00500-023-09369-1
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The most common situation encountered in the operating room scheduling is the uncertainty of operation times. This situation may cause the operations to be delayed or canceled. In this study, stochastic operating room scheduling is discussed under the uncertainty of operation times. In real life, variability may vary depending on many factors from operation to operation/patient to patient. These factors are the surgeon's experience, the difficulty of the operation, the patient's weight, age, disease history, etc. In this study, separate coefficients of variability were determined for each operation, taking into account the variability factors. Operations are scheduled, taking into account the operation-specific coefficients of variation. To evaluate the variability factors, analytical network process method was used considering the interaction between them. The level of uncertainty/coefficient of variation of each operation was determined with the PROMETHEE method. Finally, the logical modeling power of constraint programming is used to solve the operating room scheduling problem. In the proposed constraint programming model, the flexibility of the goal programming method was utilized. For the modeling of uncertainties, a chance-constrained approach was used. The case study demonstrates that the proposed approach is a novel and outstanding technique, and the proposed CP model is efficient in solving the problem. As a result of the study, the uncertainty in the operation time of each patient was calculated as the variability according to the factor weights, and the tables were reconstructed according to this situation. The performance and effectiveness of the new schedules obtained under variability are shown.
引用
收藏
页码:3987 / 4007
页数:21
相关论文
共 87 条
  • [1] A chance-constrained approach to stochastic line balancing problem
    Agpak, Kursad
    Gokcen, Hadi
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 180 (03) : 1098 - 1115
  • [2] Andra A., 2020, J APPL BUS TECHNOL, V1, P60, DOI [10.35145/jabt.v1i1.24, DOI 10.35145/JABT.V1I1.24]
  • [3] [Anonymous], 2020, INTERNET SOURCE
  • [4] Apt K.R., 2003, Principles of Constraint Programming, DOI DOI 10.1017/CBO9780511615320
  • [5] Analysis via goal programming of the minimum achievable stay in surgical waiting lists
    Arenas, M
    Bilbao, A
    Caballero, R
    Gómez, T
    Rodríguez, MV
    Ruiz, F
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2002, 53 (04) : 387 - 396
  • [6] Atalay K.D., 2011, Anadolu Universitesi Bilim ve Teknoloji Dergisi B-Teorik Bilimler., V1, P1
  • [7] Dealing with uncertain surgery times in operating room scheduling
    Azar, Macarena
    Carrasco, Rodrigo A.
    Mondschein, Susana
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2022, 299 (01) : 377 - 394
  • [8] Operating room scheduling under waiting time constraints: the Chilean GES plan
    Barrera, Javiera
    Carrasco, Rodrigo A.
    Mondschein, Susana
    Canessa, Gianpiero
    Rojas-Zalazar, David
    [J]. ANNALS OF OPERATIONS RESEARCH, 2020, 286 (1-2) : 501 - 527
  • [9] Bedir N., 2015, SOSYAL BILIMLER ARAS, V4, P46
  • [10] Two metaheuristics for solving no-wait operating room surgery scheduling problem under various resource constraints
    Belkhamsa, Manel
    Jarboui, Bassem
    Masmoudi, Malek
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2018, 126 : 494 - 506